feat: update solution to lc problem: No.0049

No.0049.Group Anagrams

Author: yanglbme

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

@@ -221,16 +221,15 @@ func groupAnagrams(strs []string) (ans [][]string) {
 
 ```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);
+    const d: Map<string, string[]> = new Map();
+    for (const s of strs) {
+        const k = s.split('').sort().join('');
+        if (!d.has(k)) {
+            d.set(k, []);
+        }
+        d.get(k)!.push(s);
     }
-    return Array.from(map.values());
+    return Array.from(d.values());
 }
 ```
 

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

@@ -178,16 +178,15 @@ func groupAnagrams(strs []string) (ans [][]string) {
 
 ```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);
+    const d: Map<string, string[]> = new Map();
+    for (const s of strs) {
+        const k = s.split('').sort().join('');
+        if (!d.has(k)) {
+            d.set(k, []);
+        }
+        d.get(k)!.push(s);
     }
-    return Array.from(map.values());
+    return Array.from(d.values());
 }
 ```
 

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

@@ -1,12 +1,12 @@
-class Solution {
-    public List<List<String>> groupAnagrams(String[] strs) {
-        Map<String, List<String>> d = new HashMap<>();
-        for (String s : strs) {
-            char[] t = s.toCharArray();
-            Arrays.sort(t);
-            String k = String.valueOf(t);
-            d.computeIfAbsent(k, key -> new ArrayList<>()).add(s);
-        }
-        return new ArrayList<>(d.values());
-    }
+class Solution {
+    public List<List<String>> groupAnagrams(String[] strs) {
+        Map<String, List<String>> d = new HashMap<>();
+        for (String s : strs) {
+            char[] t = s.toCharArray();
+            Arrays.sort(t);
+            String k = String.valueOf(t);
+            d.computeIfAbsent(k, key -> new ArrayList<>()).add(s);
+        }
+        return new ArrayList<>(d.values());
+    }
 }

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

@@ -1,12 +1,11 @@
 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);
+    const d: Map<string, string[]> = new Map();
+    for (const s of strs) {
+        const k = s.split('').sort().join('');
+        if (!d.has(k)) {
+            d.set(k, []);
+        }
+        d.get(k)!.push(s);
     }
-    return Array.from(map.values());
+    return Array.from(d.values());
 }