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

Author: rain84

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

@@ -189,6 +189,23 @@ 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/3000-3099/3016.Minimum Number of Pushes to Type Word II/README_EN.md

@@ -187,6 +187,23 @@ 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/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;
+}