feat: update 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,23 +245,20 @@ 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 s = s.as_bytes();
         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
+        let mut i = 0;
+        s.iter()
+            .map(|c| {
+                while set.contains(&c) {
+                    set.remove(&s[i]);
+                    i += 1;
+                }
+                set.insert(c);
+                set.len()
+            })
+            .max()
+            .unwrap_or(0) as i32
     }
 }
 ```

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

@@ -227,23 +227,20 @@ 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 s = s.as_bytes();
         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
+        let mut i = 0;
+        s.iter()
+            .map(|c| {
+                while set.contains(&c) {
+                    set.remove(&s[i]);
+                    i += 1;
+                }
+                set.insert(c);
+                set.len()
+            })
+            .max()
+            .unwrap_or(0) as i32
     }
 }
 ```

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

@@ -2,22 +2,19 @@ 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 s = s.as_bytes();
         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
+        let mut i = 0;
+        s.iter()
+            .map(|c| {
+                while set.contains(&c) {
+                    set.remove(&s[i]);
+                    i += 1;
+                }
+                set.insert(c);
+                set.len()
+            })
+            .max()
+            .unwrap_or(0) as i32
     }
 }