feat: add typescript solution to lc problem: No.2244

No.2244.Minimum Rounds to Complete All Tasks

Author: zhaocchen

solution/2200-2299/2244.Minimum Rounds to Complete All Tasks/README.md

@@ -65,7 +65,20 @@
 ### **TypeScript**
 
 ```ts
-
+function minimumRounds(tasks: number[]): number {
+    let hashMap = new Map();
+    for (let key of tasks) {
+        hashMap.set(key, (hashMap.get(key) || 0) + 1);
+    }
+    let ans = 0;
+    for (let key of hashMap.keys()) {
+        let val = hashMap.get(key);
+        if (val < 2) return -1;
+        const ctn = Math.floor(val / 3) + (val % 3 == 0 ? 0 : 1);
+        ans += ctn; 
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2244.Minimum Rounds to Complete All Tasks/README_EN.md

@@ -57,7 +57,20 @@ It can be shown that all the tasks cannot be completed in fewer than 4 rounds, s
 ### **TypeScript**
 
 ```ts
-
+function minimumRounds(tasks: number[]): number {
+    let hashMap = new Map();
+    for (let key of tasks) {
+        hashMap.set(key, (hashMap.get(key) || 0) + 1);
+    }
+    let ans = 0;
+    for (let key of hashMap.keys()) {
+        let val = hashMap.get(key);
+        if (val < 2) return -1;
+        const ctn = Math.floor(val / 3) + (val % 3 == 0 ? 0 : 1);
+        ans += ctn; 
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2244.Minimum Rounds to Complete All Tasks/Soluttion.ts

@@ -0,0 +1,14 @@
+function minimumRounds(tasks: number[]): number {
+    let hashMap = new Map();
+    for (let key of tasks) {
+        hashMap.set(key, (hashMap.get(key) || 0) + 1);
+    }
+    let ans = 0;
+    for (let key of hashMap.keys()) {
+        let val = hashMap.get(key);
+        if (val < 2) return -1;
+        const ctn = Math.floor(val / 3) + (val % 3 == 0 ? 0 : 1);
+        ans += ctn; 
+    }
+    return ans;
+};