feat: add solutions to lc problem: No.1046

No.1046.Last Stone Weight

Author: yanglbme

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

@@ -43,6 +43,14 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：大根堆（优先队列）**
+
+将 `stones` 数组所有元素放入大根堆，执行循环操作，每次弹出两个元素 `x` 和 `y`，如果 `x != y`，将 `x - y` 放入大根堆。当堆元素个数小于 `2` 时，退出循环。
+
+最后如果存在堆顶元素，则将其返回，否则返回 `0`。
+
+时间复杂度 $O(n\log n)$，空间复杂度 $O(n)$。其中 $n$ 是 `stones` 数组的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -52,13 +60,14 @@
 ```python
 class Solution:
     def lastStoneWeight(self, stones: List[int]) -> int:
-        h = [-s for s in stones]
+        h = [-v for v in stones]
         heapify(h)
         while len(h) > 1:
-            y, x = -heappop(h), -heappop(h)
+            x = heappop(h)
+            y = heappop(h)
             if x != y:
                 heappush(h, x - y)
-        return 0 if not h else -h[0]
+        return 0 if len(h) == 0 else -h[0]
 ```
 
 ### **Java**
@@ -68,18 +77,18 @@ class Solution:
 ```java
 class Solution {
     public int lastStoneWeight(int[] stones) {
-        Queue<Integer> queue = new PriorityQueue<>(Comparator.reverseOrder());
-        for (int stone : stones) {
-            queue.offer(stone);
+        PriorityQueue<Integer> q = new PriorityQueue<>((a, b) -> b - a);
+        for (int v : stones) {
+            q.offer(v);
         }
-        while (queue.size() > 1) {
-            int x = queue.poll();
-            int y = queue.poll();
+        while (q.size() > 1) {
+            int y = q.poll();
+            int x = q.poll();
             if (x != y) {
-                queue.offer(x - y);
+                q.offer(y - x);
             }
         }
-        return queue.isEmpty() ? 0 : queue.poll();
+        return q.isEmpty() ? 0 : q.poll();
     }
 }
 ```
@@ -92,12 +101,9 @@ public:
     int lastStoneWeight(vector<int>& stones) {
         priority_queue<int> pq(stones.begin(), stones.end());
         while (pq.size() > 1) {
-            int x = pq.top();
-            pq.pop();
-            int y = pq.top();
-            pq.pop();
-            if (x != y)
-                pq.push(x - y);
+            int x = pq.top(); pq.pop();
+            int y = pq.top(); pq.pop();
+            if (x != y) pq.push(x - y);
         }
         return pq.empty() ? 0 : pq.top();
     }
@@ -136,6 +142,29 @@ func (h *hp) push(v int) { heap.Push(h, v) }
 func (h *hp) pop() int   { return heap.Pop(h).(int) }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} stones
+ * @return {number}
+ */
+var lastStoneWeight = function (stones) {
+    const pq = new MaxPriorityQueue();
+    for (const v of stones) {
+        pq.enqueue(v);
+    }
+    while (pq.size() > 1) {
+        const x = pq.dequeue()['priority'];
+        const y = pq.dequeue()['priority'];
+        if (x != y) {
+            pq.enqueue(x - y);
+        }
+    }
+    return pq.isEmpty() ? 0 : pq.dequeue()['priority'];
+};
+```
+
 ### **...**
 
 ```

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

@@ -54,32 +54,33 @@ we combine 1 and 1 to get 0 so the array converts to [1] then that's the val
 ```python
 class Solution:
     def lastStoneWeight(self, stones: List[int]) -> int:
-        h = [-s for s in stones]
+        h = [-v for v in stones]
         heapify(h)
         while len(h) > 1:
-            y, x = -heappop(h), -heappop(h)
+            x = heappop(h)
+            y = heappop(h)
             if x != y:
                 heappush(h, x - y)
-        return 0 if not h else -h[0]
+        return 0 if len(h) == 0 else -h[0]
 ```
 
 ### **Java**
 
 ```java
 class Solution {
     public int lastStoneWeight(int[] stones) {
-        Queue<Integer> queue = new PriorityQueue<>(Comparator.reverseOrder());
-        for (int stone : stones) {
-            queue.offer(stone);
+        PriorityQueue<Integer> q = new PriorityQueue<>((a, b) -> b - a);
+        for (int v : stones) {
+            q.offer(v);
         }
-        while (queue.size() > 1) {
-            int x = queue.poll();
-            int y = queue.poll();
+        while (q.size() > 1) {
+            int y = q.poll();
+            int x = q.poll();
             if (x != y) {
-                queue.offer(x - y);
+                q.offer(y - x);
             }
         }
-        return queue.isEmpty() ? 0 : queue.poll();
+        return q.isEmpty() ? 0 : q.poll();
     }
 }
 ```
@@ -92,12 +93,9 @@ public:
     int lastStoneWeight(vector<int>& stones) {
         priority_queue<int> pq(stones.begin(), stones.end());
         while (pq.size() > 1) {
-            int x = pq.top();
-            pq.pop();
-            int y = pq.top();
-            pq.pop();
-            if (x != y)
-                pq.push(x - y);
+            int x = pq.top(); pq.pop();
+            int y = pq.top(); pq.pop();
+            if (x != y) pq.push(x - y);
         }
         return pq.empty() ? 0 : pq.top();
     }
@@ -136,6 +134,29 @@ func (h *hp) push(v int) { heap.Push(h, v) }
 func (h *hp) pop() int   { return heap.Pop(h).(int) }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} stones
+ * @return {number}
+ */
+var lastStoneWeight = function (stones) {
+    const pq = new MaxPriorityQueue();
+    for (const v of stones) {
+        pq.enqueue(v);
+    }
+    while (pq.size() > 1) {
+        const x = pq.dequeue()['priority'];
+        const y = pq.dequeue()['priority'];
+        if (x != y) {
+            pq.enqueue(x - y);
+        }
+    }
+    return pq.isEmpty() ? 0 : pq.dequeue()['priority'];
+};
+```
+
 ### **...**
 
 ```

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

@@ -3,13 +3,10 @@ class Solution {
     int lastStoneWeight(vector<int>& stones) {
         priority_queue<int> pq(stones.begin(), stones.end());
         while (pq.size() > 1) {
-            int x = pq.top();
-            pq.pop();
-            int y = pq.top();
-            pq.pop();
-            if (x != y)
-                pq.push(x - y);
+            int x = pq.top(); pq.pop();
+            int y = pq.top(); pq.pop();
+            if (x != y) pq.push(x - y);
         }
         return pq.empty() ? 0 : pq.top();
     }
-};
+};

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

@@ -1,16 +1,16 @@
 class Solution {
     public int lastStoneWeight(int[] stones) {
-        Queue<Integer> queue = new PriorityQueue<>(Comparator.reverseOrder());
-        for (int stone : stones) {
-            queue.offer(stone);
+        PriorityQueue<Integer> q = new PriorityQueue<>((a, b) -> b - a);
+        for (int v : stones) {
+            q.offer(v);
         }
-        while (queue.size() > 1) {
-            int x = queue.poll();
-            int y = queue.poll();
+        while (q.size() > 1) {
+            int y = q.poll();
+            int x = q.poll();
             if (x != y) {
-                queue.offer(x - y);
+                q.offer(y - x);
             }
         }
-        return queue.isEmpty() ? 0 : queue.poll();
+        return q.isEmpty() ? 0 : q.poll();
     }
-}
+}

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

@@ -0,0 +1,18 @@
+/**
+ * @param {number[]} stones
+ * @return {number}
+ */
+var lastStoneWeight = function (stones) {
+    const pq = new MaxPriorityQueue();
+    for (const v of stones) {
+        pq.enqueue(v);
+    }
+    while (pq.size() > 1) {
+        const x = pq.dequeue()['priority'];
+        const y = pq.dequeue()['priority'];
+        if (x != y) {
+            pq.enqueue(x - y);
+        }
+    }
+    return pq.isEmpty() ? 0 : pq.dequeue()['priority'];
+};

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

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