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

 No.0347.Top K Frequent Elements

Author: zhaocchen

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

@@ -112,6 +112,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```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]);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

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

@@ -93,6 +93,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```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]);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

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

@@ -0,0 +1,13 @@
+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]);
+    }
+    return ans;
+};