feat: add solutions to lcci problem: No.01.02

No.01.02.Check Permutation

Author: YangFong

lcci/01.02.Check Permutation/README.md

@@ -141,6 +141,83 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function CheckPermutation(s1: string, s2: string): boolean {
+    const n = s1.length;
+    const m = s2.length;
+    if (n !== m) {
+        return false;
+    }
+    const map = new Map<string, number>();
+    for (let i = 0; i < n; i++) {
+        map.set(s1[i], (map.get(s1[i]) || 0) + 1);
+        map.set(s2[i], (map.get(s2[i]) || 0) - 1);
+    }
+    for (const v of map.values()) {
+        if (v !== 0) {
+            return false;
+        }
+    }
+    return true;
+}
+```
+
+```ts
+function CheckPermutation(s1: string, s2: string): boolean {
+    if (s1.length !== s2.length) {
+        return false;
+    }
+    return (
+        s1
+            .split('')
+            .sort((a, b) => a.charCodeAt(0) - b.charCodeAt(0))
+            .join('') ===
+        s2
+            .split('')
+            .sort((a, b) => a.charCodeAt(0) - b.charCodeAt(0))
+            .join('')
+    );
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn check_permutation(s1: String, s2: String) -> bool {
+        let n = s1.len();
+        let m = s2.len();
+        if n != m {
+            return false;
+        }
+        let s1: Vec<char> = s1.chars().collect();
+        let s2: Vec<char> = s2.chars().collect();
+        let mut map = HashMap::new();
+        for i in 0..n {
+            map.insert(s1[i], map.get(&s1[i]).unwrap_or(&0) + 1);
+            map.insert(s2[i], map.get(&s2[i]).unwrap_or(&0) - 1);
+        }
+        map.values().all(|i| *i == 0)
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn check_permutation(s1: String, s2: String) -> bool {
+        let mut v1: Vec<char> = s1.chars().collect();
+        let mut v2: Vec<char> = s2.chars().collect();
+        v1.sort();
+        v2.sort();
+        v1 == v2
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/01.02.Check Permutation/README_EN.md

@@ -139,6 +139,84 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function CheckPermutation(s1: string, s2: string): boolean {
+    const n = s1.length;
+    const m = s2.length;
+    if (n !== m) {
+        return false;
+    }
+    const map = new Map<string, number>();
+    for (let i = 0; i < n; i++) {
+        map.set(s1[i], (map.get(s1[i]) || 0) + 1);
+        map.set(s2[i], (map.get(s2[i]) || 0) - 1);
+    }
+    for (const v of map.values()) {
+        if (v !== 0) {
+            return false;
+        }
+    }
+    return true;
+}
+```
+
+```ts
+function CheckPermutation(s1: string, s2: string): boolean {
+    if (s1.length !== s2.length) {
+        return false;
+    }
+    return (
+        s1
+            .split('')
+            .sort((a, b) => a.charCodeAt(0) - b.charCodeAt(0))
+            .join('') ===
+        s2
+            .split('')
+            .sort((a, b) => a.charCodeAt(0) - b.charCodeAt(0))
+            .join('')
+    );
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn check_permutation(s1: String, s2: String) -> bool {
+        let n = s1.len();
+        let m = s2.len();
+        if n != m {
+            return false;
+        }
+        let s1: Vec<char> = s1.chars().collect();
+        let s2: Vec<char> = s2.chars().collect();
+        let mut map = HashMap::new();
+        for i in 0..n {
+            map.insert(s1[i], map.get(&s1[i]).unwrap_or(&0) + 1);
+            map.insert(s2[i], map.get(&s2[i]).unwrap_or(&0) - 1);
+        }
+        map.values().all(|i| *i == 0)
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn check_permutation(s1: String, s2: String) -> bool {
+        let mut v1: Vec<char> = s1.chars().collect();
+        let mut v2: Vec<char> = s2.chars().collect();
+        v1.sort();
+        v2.sort();
+        v1 == v2
+    }
+}
+```
+
+
 ### **...**
 
 ```

lcci/01.02.Check Permutation/Solution.rs

@@ -0,0 +1,9 @@
+impl Solution {
+    pub fn check_permutation(s1: String, s2: String) -> bool {
+        let mut v1: Vec<char> = s1.chars().collect();
+        let mut v2: Vec<char> = s2.chars().collect();
+        v1.sort();
+        v2.sort();
+        v1 == v2
+    }
+}

lcci/01.02.Check Permutation/Solution.ts

@@ -0,0 +1,18 @@
+function CheckPermutation(s1: string, s2: string): boolean {
+    const n = s1.length;
+    const m = s2.length;
+    if (n !== m) {
+        return false;
+    }
+    const map = new Map<string, number>();
+    for (let i = 0; i < n; i++) {
+        map.set(s1[i], (map.get(s1[i]) || 0) + 1);
+        map.set(s2[i], (map.get(s2[i]) || 0) - 1);
+    }
+    for (const v of map.values()) {
+        if (v !== 0) {
+            return false;
+        }
+    }
+    return true;
+}