feat: update ts solution to lc problem No.0347

Author: rain84

solution/0300-0399/0347.Top K Frequent Elements/README.md

@@ -159,17 +159,15 @@ func (h *hp) Pop() any          { a := *h; v := a[len(a)-1]; *h = a[:len(a)-1];
 
 ```ts
 function topKFrequent(nums: number[], k: number): number[] {
-    let hashMap = new Map();
-    for (let num of nums) {
-        hashMap.set(num, (hashMap.get(num) || 0) + 1);
-    }
-    let list = [...hashMap];
-    list.sort((a, b) => b[1] - a[1]);
-    let ans = [];
-    for (let i = 0; i < k; i++) {
-        ans.push(list[i][0]);
+    const cnt = new Map();
+    for (const num of nums) {
+        cnt.set(num, (cnt.get(num) || 0) + 1);
     }
-    return ans;
+
+    return [...cnt]
+        .sort((a, b) => b[1] - a[1])
+        .splice(0, k)
+        .map(([x]) => x);
 }
 ```
 

solution/0300-0399/0347.Top K Frequent Elements/README_EN.md

@@ -147,17 +147,15 @@ func (h *hp) Pop() any          { a := *h; v := a[len(a)-1]; *h = a[:len(a)-1];
 
 ```ts
 function topKFrequent(nums: number[], k: number): number[] {
-    let hashMap = new Map();
-    for (let num of nums) {
-        hashMap.set(num, (hashMap.get(num) || 0) + 1);
-    }
-    let list = [...hashMap];
-    list.sort((a, b) => b[1] - a[1]);
-    let ans = [];
-    for (let i = 0; i < k; i++) {
-        ans.push(list[i][0]);
+    const cnt = new Map();
+    for (const num of nums) {
+        cnt.set(num, (cnt.get(num) || 0) + 1);
     }
-    return ans;
+
+    return [...cnt]
+        .sort((a, b) => b[1] - a[1])
+        .splice(0, k)
+        .map(([x]) => x);
 }
 ```
 

solution/0300-0399/0347.Top K Frequent Elements/Solution.ts

@@ -1,13 +1,11 @@
 function topKFrequent(nums: number[], k: number): number[] {
-    let hashMap = new Map();
-    for (let num of nums) {
-        hashMap.set(num, (hashMap.get(num) || 0) + 1);
+    const cnt = new Map();
+    for (const num of nums) {
+        cnt.set(num, (cnt.get(num) || 0) + 1);
     }
-    let list = [...hashMap];
-    list.sort((a, b) => b[1] - a[1]);
-    let ans = [];
-    for (let i = 0; i < k; i++) {
-        ans.push(list[i][0]);
-    }
-    return ans;
+
+    return [...cnt]
+        .sort((a, b) => b[1] - a[1])
+        .splice(0, k)
+        .map(([x]) => x);
 }