feat: add typescript solution to lc problem: No.0049.Group Anagrams (doocs#584)

Author: zhaocchen

solution/0000-0099/0049.Group Anagrams/README.md

@@ -74,6 +74,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function groupAnagrams(strs: string[]): string[][] {
+    let map = new Map();
+    for (let str of strs) {
+        let arr = str.split('');
+        arr.sort();
+        let key  = arr.join('');
+        let value = map.get(key) ? map.get(key) : [];
+        value.push(str);
+        map.set(key, value);
+    }
+    return Array.from(map.values());
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0000-0099/0049.Group Anagrams/README_EN.md

@@ -61,6 +61,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function groupAnagrams(strs: string[]): string[][] {
+    let map = new Map();
+    for (let str of strs) {
+        let arr = str.split('');
+        arr.sort();
+        let key  = arr.join('');
+        let value = map.get(key) ? map.get(key) : [];
+        value.push(str);
+        map.set(key, value);
+    }
+    return Array.from(map.values());
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0000-0099/0049.Group Anagrams/Solution.ts

@@ -0,0 +1,12 @@
+function groupAnagrams(strs: string[]): string[][] {
+    let map = new Map();
+    for (let str of strs) {
+        let arr = str.split('');
+        arr.sort();
+        let key  = arr.join('');
+        let value = map.get(key) ? map.get(key) : [];
+        value.push(str);
+        map.set(key, value);
+    }
+    return Array.from(map.values());
+};