feat: add solutions to lcci problem: No.10.02

No.10.02.Group Anagrams

Author: YangFong

lcci/10.02.Group Anagrams/README.md

@@ -118,6 +118,40 @@ func groupAnagrams(strs []string) [][]string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function groupAnagrams(strs: string[]): string[][] {
+    const map = new Map<string, string[]>();
+    for (const s of strs) {
+        const k = s.split('').sort().join();
+        map.set(k, (map.get(k) || []).concat([s]));
+    }
+    return [...map.values()];
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
+        let mut map = HashMap::new();
+        for s in strs {
+            let key = {
+                let mut cs = s.chars().collect::<Vec<char>>();
+                cs.sort();
+                cs.iter().collect::<String>()
+            };
+            map.entry(key).or_insert(vec![]).push(s);
+        }
+        map.into_values().collect()
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/10.02.Group Anagrams/README_EN.md

@@ -115,6 +115,41 @@ func groupAnagrams(strs []string) [][]string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function groupAnagrams(strs: string[]): string[][] {
+    const map = new Map<string, string[]>();
+    for (const s of strs) {
+        const k = s.split('').sort().join();
+        map.set(k, (map.get(k) || []).concat([s]));
+    }
+    return [...map.values()];
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
+        let mut map = HashMap::new();
+        for s in strs {
+            let key = {
+                let mut cs = s.chars().collect::<Vec<char>>();
+                cs.sort();
+                cs.iter().collect::<String>()
+            };
+            map.entry(key).or_insert(vec![]).push(s);
+        }
+        map.into_values().collect()
+    }
+}
+```
+
+
 ### **...**
 
 ```

lcci/10.02.Group Anagrams/Solution.rs

@@ -0,0 +1,16 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
+        let mut map = HashMap::new();
+        for s in strs {
+            let key = {
+                let mut cs = s.chars().collect::<Vec<char>>();
+                cs.sort();
+                cs.iter().collect::<String>()
+            };
+            map.entry(key).or_insert(vec![]).push(s);
+        }
+        map.into_values().collect()
+    }
+}

lcci/10.02.Group Anagrams/Solution.ts

@@ -0,0 +1,8 @@
+function groupAnagrams(strs: string[]): string[][] {
+    const map = new Map<string, string[]>();
+    for (const s of strs) {
+        const k = s.split('').sort().join();
+        map.set(k, (map.get(k) || []).concat([s]));
+    }
+    return [...map.values()];
+}