feat: add ts solution to lc problem: No.2208 (#1294)

Author: thinkasany

solution/2200-2299/2208.Minimum Operations to Halve Array Sum/README.md

@@ -158,7 +158,22 @@ func (hp) Pop() (_ interface{}) { return }
 ### **TypeScript**
 
 ```ts
-
+function halveArray(nums: number[]): number {
+    let s: number = nums.reduce((a, b) => a + b) / 2;
+    const h = new MaxPriorityQueue();
+    for (const v of nums) {
+        h.enqueue(v, v);
+    }
+    let ans: number = 0;
+    while (s > 0) {
+        let { element: t } = h.dequeue();
+        t /= 2;
+        s -= t;
+        h.enqueue(t, t);
+        ans += 1;
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/2200-2299/2208.Minimum Operations to Halve Array Sum/README_EN.md

@@ -150,7 +150,22 @@ func (hp) Pop() (_ interface{}) { return }
 ### **TypeScript**
 
 ```ts
-
+function halveArray(nums: number[]): number {
+    let s: number = nums.reduce((a, b) => a + b) / 2;
+    const h = new MaxPriorityQueue();
+    for (const v of nums) {
+        h.enqueue(v, v);
+    }
+    let ans: number = 0;
+    while (s > 0) {
+        let { element: t } = h.dequeue();
+        t /= 2;
+        s -= t;
+        h.enqueue(t, t);
+        ans += 1;
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/2200-2299/2208.Minimum Operations to Halve Array Sum/Solution.ts

@@ -0,0 +1,16 @@
+function halveArray(nums: number[]): number {
+    let s: number = nums.reduce((a, b) => a + b) / 2;
+    const h = new MaxPriorityQueue();
+    for (const v of nums) {
+        h.enqueue(v, v);
+    }
+    let ans: number = 0;
+    while (s > 0) {
+        let { element: t } = h.dequeue();
+        t /= 2;
+        s -= t;
+        h.enqueue(t, t);
+        ans += 1;
+    }
+    return ans;
+}