feat: add solutions to lcof problem: No.50

面试题 50. 第一个只出现一次的字符

Author: YangFong

lcof/面试题50. 第一个只出现一次的字符/README.md

@@ -107,6 +107,50 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function firstUniqChar(s: string): string {
+    const map = new Map();
+    for (const c of s) {
+        map.set(c, !map.has(c));
+    }
+    for (const c of s) {
+        if (map.get(c)) {
+            return c;
+        }
+    }
+    return ' ';
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn first_uniq_char(s: String) -> char {
+        let mut map = HashMap::new();
+        let s = s.chars().collect::<Vec<char>>();
+        for c in s.iter() {
+            match map.contains_key(c) {
+                true => map.insert(c, false),
+                false => map.insert(c, true),
+            };
+        }
+        for c in s.iter() {
+            if let Some(is_single) = map.get(c) {
+                if *is_single {
+                    return *c;
+                }
+            }
+        }
+        ' '
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题50. 第一个只出现一次的字符/Solution.rs

@@ -0,0 +1,22 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn first_uniq_char(s: String) -> char {
+        let mut map = HashMap::new();
+        let s = s.chars().collect::<Vec<char>>();
+        for c in s.iter() {
+            match map.contains_key(c) {
+                true => map.insert(c, false),
+                false => map.insert(c, true),
+            };
+        }
+        for c in s.iter() {
+            if let Some(is_single) = map.get(c) {
+                if *is_single {
+                    return *c;
+                }
+            }
+        }
+        ' '
+    }
+}

lcof/面试题50. 第一个只出现一次的字符/Solution.ts

@@ -0,0 +1,12 @@
+function firstUniqChar(s: string): string {
+    const map = new Map();
+    for (const c of s) {
+        map.set(c, !map.has(c));
+    }
+    for (const c of s) {
+        if (map.get(c)) {
+            return c;
+        }
+    }
+    return ' ';
+}