feat: add js/ts solutions to lc problem: No.3016 (doocs#3371)

Author: rain84

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

@@ -189,6 +189,83 @@ function minimumPushes(word: string): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function minimumPushes(word) {
+    const cnt = Array(26).fill(0);
+    for (const c of word) {
+        ++cnt[c.charCodeAt(0) - 'a'.charCodeAt(0)];
+    }
+    cnt.sort((a, b) => b - a);
+    let ans = 0;
+    for (let i = 0; i < 26; ++i) {
+        ans += (((i / 8) | 0) + 1) * cnt[i];
+    }
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### 方法二：优先队列（大根堆）
+
+<!-- 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;
+}
+```
+
+#### JavaScript
+
+```js
+function minimumPushes(word) {
+    const pq = new MaxPriorityQueue();
+    const cnt = new Map();
+    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 -->

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

@@ -187,6 +187,83 @@ function minimumPushes(word: string): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function minimumPushes(word) {
+    const cnt = Array(26).fill(0);
+    for (const c of word) {
+        ++cnt[c.charCodeAt(0) - 'a'.charCodeAt(0)];
+    }
+    cnt.sort((a, b) => b - a);
+    let ans = 0;
+    for (let i = 0; i < 26; ++i) {
+        ans += (((i / 8) | 0) + 1) * cnt[i];
+    }
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- 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;
+}
+```
+
+#### JavaScript
+
+```js
+function minimumPushes(word) {
+    const pq = new MaxPriorityQueue();
+    const cnt = new Map();
+    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 -->

solution/3000-3099/3016.Minimum Number of Pushes to Type Word II/Solution.js

@@ -0,0 +1,12 @@
+function minimumPushes(word) {
+    const cnt = Array(26).fill(0);
+    for (const c of word) {
+        ++cnt[c.charCodeAt(0) - 'a'.charCodeAt(0)];
+    }
+    cnt.sort((a, b) => b - a);
+    let ans = 0;
+    for (let i = 0; i < 26; ++i) {
+        ans += (((i / 8) | 0) + 1) * cnt[i];
+    }
+    return ans;
+}

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

@@ -0,0 +1,20 @@
+function minimumPushes(word) {
+    const pq = new MaxPriorityQueue();
+    const cnt = new Map();
+    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;
+}

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;
+}