feat: add ts solution to lc problem: No.3016

Author: rain84

solution/3000-3099/3016.Minimum Number of Pushes to Type Word II/README.md

@@ -210,4 +210,39 @@ function minimumPushes(word) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Priority Queue
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function minimumPushes(word: string): number {
+    const pq = new MaxPriorityQueue();
+    const cnt = new Map<string, number>();
+    let [i, res] = [0, 0];
+
+    for (const x of word) {
+        cnt.set(x, (cnt.get(x) ?? 0) + 1);
+    }
+
+    for (const [x, c] of cnt) {
+        pq.enqueue(x, c);
+    }
+
+    while (!pq.isEmpty()) {
+        const c = pq.dequeue().priority;
+        res += c * (((i++ / 8) | 0) + 1);
+    }
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/3000-3099/3016.Minimum Number of Pushes to Type Word II/README_EN.md

@@ -208,4 +208,39 @@ function minimumPushes(word) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Priority Queue
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function minimumPushes(word: string): number {
+    const pq = new MaxPriorityQueue();
+    const cnt = new Map<string, number>();
+    let [i, res] = [0, 0];
+
+    for (const x of word) {
+        cnt.set(x, (cnt.get(x) ?? 0) + 1);
+    }
+
+    for (const [x, c] of cnt) {
+        pq.enqueue(x, c);
+    }
+
+    while (!pq.isEmpty()) {
+        const c = pq.dequeue().priority;
+        res += c * (((i++ / 8) | 0) + 1);
+    }
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/3000-3099/3016.Minimum Number of Pushes to Type Word II/Solution2.ts

@@ -0,0 +1,20 @@
+function minimumPushes(word: string): number {
+    const pq = new MaxPriorityQueue();
+    const cnt = new Map<string, number>();
+    let [i, res] = [0, 0];
+
+    for (const x of word) {
+        cnt.set(x, (cnt.get(x) ?? 0) + 1);
+    }
+
+    for (const [x, c] of cnt) {
+        pq.enqueue(x, c);
+    }
+
+    while (!pq.isEmpty()) {
+        const c = pq.dequeue().priority;
+        res += c * (((i++ / 8) | 0) + 1);
+    }
+
+    return res;
+}