feat: add solutions to lcof problem: No.48

面试题48. 最长不含重复字符的子字符串

Author: YangFong

lcof/面试题48. 最长不含重复字符的子字符串/README.md

@@ -151,6 +151,48 @@ var lengthOfLongestSubstring = function (s) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function lengthOfLongestSubstring(s: string): number {
+    let res = 0;
+    let l = 0;
+    let set = new Set<string>();
+    for (const c of s) {
+        while (set.has(c)) {
+            set.delete(s[l++]);
+        }
+        set.add(c);
+        res = Math.max(res, set.size);
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn length_of_longest_substring(s: String) -> i32 {
+        let mut res = 0;
+        let mut i = 0;
+        let mut set = HashSet::new();
+        let chars = s.chars().collect::<Vec<char>>();
+        for c in chars.iter() {
+            while set.contains(c) {
+                set.remove(&chars[i]);
+                i += 1;
+            }
+            set.insert(c);
+            res = res.max(set.len())
+        }
+        res as i32
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题48. 最长不含重复字符的子字符串/Solution.rs

@@ -0,0 +1,19 @@
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn length_of_longest_substring(s: String) -> i32 {
+        let mut res = 0;
+        let mut i = 0;
+        let mut set = HashSet::new();
+        let chars = s.chars().collect::<Vec<char>>();
+        for c in chars.iter() {
+            while set.contains(c) {
+                set.remove(&chars[i]);
+                i += 1;
+            }
+            set.insert(c);
+            res = res.max(set.len())
+        }
+        res as i32
+    }
+}

lcof/面试题48. 最长不含重复字符的子字符串/Solution.ts

@@ -0,0 +1,13 @@
+function lengthOfLongestSubstring(s: string): number {
+    let res = 0;
+    let l = 0;
+    let set = new Set<string>();
+    for (const c of s) {
+        while (set.has(c)) {
+            set.delete(s[l++]);
+        }
+        set.add(c);
+        res = Math.max(res, set.size);
+    }
+    return res;
+}