feat: add rust solution to lc problem: No.0003

No.0003.Longest Substring Without Repeating Characters

Author: YangFong

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -245,6 +245,34 @@ proc lengthOfLongestSubstring(s: string): int =
   result = res # result has the default return value
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn length_of_longest_substring(s: String) -> i32 {
+        let n = s.len();
+        let cs: Vec<char> = s.chars().collect();
+        let mut set = HashSet::new();
+        let mut l = 0;
+        let mut r = 0;
+        let mut res = 0;
+        while r != n {
+            let k = cs[r];
+            while set.contains(&k) {
+                set.remove(&cs[l]);
+                l += 1;
+            }
+            set.insert(k);
+            res = res.max(set.len());
+            r += 1;
+        }
+        res as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

@@ -227,6 +227,34 @@ proc lengthOfLongestSubstring(s: string): int =
   result = res # result has the default return value
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn length_of_longest_substring(s: String) -> i32 {
+        let n = s.len();
+        let cs: Vec<char> = s.chars().collect();
+        let mut set = HashSet::new();
+        let mut l = 0;
+        let mut r = 0;
+        let mut res = 0;
+        while r != n {
+            let k = cs[r];
+            while set.contains(&k) {
+                set.remove(&cs[l]);
+                l += 1;
+            }
+            set.insert(k);
+            res = res.max(set.len());
+            r += 1;
+        }
+        res as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.rs

@@ -0,0 +1,23 @@
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn length_of_longest_substring(s: String) -> i32 {
+        let n = s.len();
+        let cs: Vec<char> = s.chars().collect();
+        let mut set = HashSet::new();
+        let mut l = 0;
+        let mut r = 0;
+        let mut res = 0;
+        while r != n {
+            let k = cs[r];
+            while set.contains(&k) {
+                set.remove(&cs[l]);
+                l += 1;
+            }
+            set.insert(k);
+            res = res.max(set.len());
+            r += 1;
+        }
+        res as i32
+    }
+}