feat: add solutions to lc problem: No.2451

No.2451.Odd String Difference

Author: YangFong

solution/2400-2499/2451.Odd String Difference/README.md

@@ -152,7 +152,51 @@ func oddString(words []string) string {
 ### **TypeScript**
 
 ```ts
+function oddString(words: string[]): string {
+    const n = words[0].length;
+    const map = new Map<string, [boolean, number]>();
+    words.forEach((word, i) => {
+        const diff: number[] = [];
+        for (let j = 1; j < n; j++) {
+            diff.push(word[j].charCodeAt(0) - word[j - 1].charCodeAt(0));
+        }
+        const k = diff.join();
+        map.set(k, [!map.has(k), i]);
+    });
+    for (const [isOnly, i] of map.values()) {
+        if (isOnly) {
+            return words[i];
+        }
+    }
+    return '';
+}
+```
 
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+impl Solution {
+    pub fn odd_string(words: Vec<String>) -> String {
+        let n = words[0].len();
+        let mut map: HashMap<String, (bool, usize)> = HashMap::new();
+        for (i, word) in words.iter().enumerate() {
+            let mut k = String::new();
+            for j in 1..n {
+                k.push_str(&(word.as_bytes()[j] - word.as_bytes()[j - 1]).to_string());
+                k.push(',');
+            }
+            let new_is_only = !map.contains_key(&k);
+            map.insert(k, (new_is_only, i));
+        }
+        for (is_only, i) in map.values() {
+            if *is_only {
+                return words[*i].clone();
+            }
+        }
+        String::new()
+    }
+}
 ```
 
 ### **...**

solution/2400-2499/2451.Odd String Difference/README_EN.md

@@ -136,7 +136,51 @@ func oddString(words []string) string {
 ### **TypeScript**
 
 ```ts
+function oddString(words: string[]): string {
+    const n = words[0].length;
+    const map = new Map<string, [boolean, number]>();
+    words.forEach((word, i) => {
+        const diff: number[] = [];
+        for (let j = 1; j < n; j++) {
+            diff.push(word[j].charCodeAt(0) - word[j - 1].charCodeAt(0));
+        }
+        const k = diff.join();
+        map.set(k, [!map.has(k), i]);
+    });
+    for (const [isOnly, i] of map.values()) {
+        if (isOnly) {
+            return words[i];
+        }
+    }
+    return '';
+}
+```
 
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+impl Solution {
+    pub fn odd_string(words: Vec<String>) -> String {
+        let n = words[0].len();
+        let mut map: HashMap<String, (bool, usize)> = HashMap::new();
+        for (i, word) in words.iter().enumerate() {
+            let mut k = String::new();
+            for j in 1..n {
+                k.push_str(&(word.as_bytes()[j] - word.as_bytes()[j - 1]).to_string());
+                k.push(',');
+            }
+            let new_is_only = !map.contains_key(&k);
+            map.insert(k, (new_is_only, i));
+        }
+        for (is_only, i) in map.values() {
+            if *is_only {
+                return words[*i].clone();
+            }
+        }
+        String::new()
+    }
+}
 ```
 
 ### **...**

solution/2400-2499/2451.Odd String Difference/Solution.rs

@@ -0,0 +1,22 @@
+use std::collections::HashMap;
+impl Solution {
+    pub fn odd_string(words: Vec<String>) -> String {
+        let n = words[0].len();
+        let mut map: HashMap<String, (bool, usize)> = HashMap::new();
+        for (i, word) in words.iter().enumerate() {
+            let mut k = String::new();
+            for j in 1..n {
+                k.push_str(&(word.as_bytes()[j] - word.as_bytes()[j - 1]).to_string());
+                k.push(',');
+            }
+            let new_is_only = !map.contains_key(&k);
+            map.insert(k, (new_is_only, i));
+        }
+        for (is_only, i) in map.values() {
+            if *is_only {
+                return words[*i].clone();
+            }
+        }
+        String::new()
+    }
+}

solution/2400-2499/2451.Odd String Difference/Solution.ts

@@ -0,0 +1,18 @@
+function oddString(words: string[]): string {
+    const n = words[0].length;
+    const map = new Map<string, [boolean, number]>();
+    words.forEach((word, i) => {
+        const diff: number[] = [];
+        for (let j = 1; j < n; j++) {
+            diff.push(word[j].charCodeAt(0) - word[j - 1].charCodeAt(0));
+        }
+        const k = diff.join();
+        map.set(k, [!map.has(k), i]);
+    });
+    for (const [isOnly, i] of map.values()) {
+        if (isOnly) {
+            return words[i];
+        }
+    }
+    return '';
+}