feat: add solutions to lc problem: No.1046

No.1046.Last Stone Weight

Author: yanglbme

solution/1000-1099/1046.Last Stone Weight/README.md

@@ -50,7 +50,15 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def lastStoneWeight(self, stones: List[int]) -> int:
+        h = [-s for s in stones]
+        heapify(h)
+        while len(h) > 1:
+            y, x = -heappop(h), -heappop(h)
+            if x != y:
+                heappush(h, x - y)
+        return 0 if not h else -h[0]
 ```
 
 ### **Java**
@@ -96,4 +104,42 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func lastStoneWeight(stones []int) int {
+	q := &hp{stones}
+	heap.Init(q)
+	for q.Len() > 1 {
+		x, y := q.pop(), q.pop()
+		if x != y {
+			q.push(x - y)
+		}
+	}
+	if q.Len() > 0 {
+		return q.IntSlice[0]
+	}
+	return 0
+}
+
+type hp struct{ sort.IntSlice }
+
+func (h hp) Less(i, j int) bool  { return h.IntSlice[i] > h.IntSlice[j] }
+func (h *hp) Push(v interface{}) { h.IntSlice = append(h.IntSlice, v.(int)) }
+func (h *hp) Pop() interface{} {
+	a := h.IntSlice
+	v := a[len(a)-1]
+	h.IntSlice = a[:len(a)-1]
+	return v
+}
+func (h *hp) push(v int) { heap.Push(h, v) }
+func (h *hp) pop() int   { return heap.Pop(h).(int) }
+```
+
+### **...**
+
+```
+
+```
+
 <!-- tabs:end -->

solution/1000-1099/1046.Last Stone Weight/README_EN.md

@@ -52,7 +52,15 @@ we combine 1 and 1 to get 0 so the array converts to [1] then that's the val
 ### **Python3**
 
 ```python
-
+class Solution:
+    def lastStoneWeight(self, stones: List[int]) -> int:
+        h = [-s for s in stones]
+        heapify(h)
+        while len(h) > 1:
+            y, x = -heappop(h), -heappop(h)
+            if x != y:
+                heappush(h, x - y)
+        return 0 if not h else -h[0]
 ```
 
 ### **Java**
@@ -96,4 +104,42 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func lastStoneWeight(stones []int) int {
+	q := &hp{stones}
+	heap.Init(q)
+	for q.Len() > 1 {
+		x, y := q.pop(), q.pop()
+		if x != y {
+			q.push(x - y)
+		}
+	}
+	if q.Len() > 0 {
+		return q.IntSlice[0]
+	}
+	return 0
+}
+
+type hp struct{ sort.IntSlice }
+
+func (h hp) Less(i, j int) bool  { return h.IntSlice[i] > h.IntSlice[j] }
+func (h *hp) Push(v interface{}) { h.IntSlice = append(h.IntSlice, v.(int)) }
+func (h *hp) Pop() interface{} {
+	a := h.IntSlice
+	v := a[len(a)-1]
+	h.IntSlice = a[:len(a)-1]
+	return v
+}
+func (h *hp) push(v int) { heap.Push(h, v) }
+func (h *hp) pop() int   { return heap.Pop(h).(int) }
+```
+
+### **...**
+
+```
+
+```
+
 <!-- tabs:end -->

solution/1000-1099/1046.Last Stone Weight/Solution.go

@@ -0,0 +1,27 @@
+func lastStoneWeight(stones []int) int {
+	q := &hp{stones}
+	heap.Init(q)
+	for q.Len() > 1 {
+		x, y := q.pop(), q.pop()
+		if x != y {
+			q.push(x - y)
+		}
+	}
+	if q.Len() > 0 {
+		return q.IntSlice[0]
+	}
+	return 0
+}
+
+type hp struct{ sort.IntSlice }
+
+func (h hp) Less(i, j int) bool  { return h.IntSlice[i] > h.IntSlice[j] }
+func (h *hp) Push(v interface{}) { h.IntSlice = append(h.IntSlice, v.(int)) }
+func (h *hp) Pop() interface{} {
+	a := h.IntSlice
+	v := a[len(a)-1]
+	h.IntSlice = a[:len(a)-1]
+	return v
+}
+func (h *hp) push(v int) { heap.Push(h, v) }
+func (h *hp) pop() int   { return heap.Pop(h).(int) }

solution/1000-1099/1046.Last Stone Weight/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def lastStoneWeight(self, stones: List[int]) -> int:
+        h = [-s for s in stones]
+        heapify(h)
+        while len(h) > 1:
+            y, x = -heappop(h), -heappop(h)
+            if x != y:
+                heappush(h, x - y)
+        return 0 if not h else -h[0]