refactor: update ts solution to lc problem: No.1962 (#3167)

Author: rain84

solution/1900-1999/1962.Remove Stones to Minimize the Total/README.md

@@ -185,14 +185,10 @@ function minStoneSum(piles: number[], k: number): number {
         pq.enqueue(x);
     }
     while (k--) {
-        const x = pq.dequeue().element;
-        pq.enqueue(x - ((x / 2) | 0));
+        pq.enqueue((pq.dequeue().element + 1) >> 1);
     }
-    let ans = 0;
-    while (pq.size()) {
-        ans += pq.dequeue().element;
-    }
-    return ans;
+
+    return pq.toArray().reduce((a, b) => a + b.element, 0);
 }
 ```
 

solution/1900-1999/1962.Remove Stones to Minimize the Total/README_EN.md

@@ -183,14 +183,10 @@ function minStoneSum(piles: number[], k: number): number {
         pq.enqueue(x);
     }
     while (k--) {
-        const x = pq.dequeue().element;
-        pq.enqueue(x - ((x / 2) | 0));
+        pq.enqueue((pq.dequeue().element + 1) >> 1);
     }
-    let ans = 0;
-    while (pq.size()) {
-        ans += pq.dequeue().element;
-    }
-    return ans;
+
+    return pq.toArray().reduce((a, b) => a + b.element, 0);
 }
 ```
 

solution/1900-1999/1962.Remove Stones to Minimize the Total/Solution.ts

@@ -4,12 +4,8 @@ function minStoneSum(piles: number[], k: number): number {
         pq.enqueue(x);
     }
     while (k--) {
-        const x = pq.dequeue().element;
-        pq.enqueue(x - ((x / 2) | 0));
+        pq.enqueue((pq.dequeue().element + 1) >> 1);
     }
-    let ans = 0;
-    while (pq.size()) {
-        ans += pq.dequeue().element;
-    }
-    return ans;
+
+    return pq.toArray().reduce((a, b) => a + b.element, 0);
 }