idr

jhideki · jhideki · commit f08a2db8ad91 · 2024-03-05T22:38:54.000-08:00
diff --git a/src/longest_substring.rs b/src/longest_substring.rs
@@ -0,0 +1,21 @@
+use std::{cmp::max, collections::HashSet};
+
+pub struct Solution {}
+impl Solution {
+    pub fn length_of_longest_substring(s: String) -> i32 {
+        let mut length = 0;
+        let mut lp = 0;
+        let c: Vec<char> = s.chars().collect();
+        let mut set: HashSet<char> = HashSet::new();
+        println!("{}", c.len());
+        for i in 0..c.len() {
+            while set.contains(&c[i]) {
+                set.remove(&c[lp]);
+                lp += 1;
+            }
+            length = max(i - lp + 1, length);
+            set.insert(c[i]);
+        }
+        length as i32
+    }
+}
diff --git a/src/main.rs b/src/main.rs
@@ -1,7 +1,7 @@
-mod buy_and_sell_stock;
-use buy_and_sell_stock::Solution;
+mod longest_substring;
+use longest_substring::Solution;
 fn main() {
-    let nums1 = vec![7, 1, 5, 3, 6, 4];
-    let result = Solution::max_profit(nums1);
+    let s = "au".to_string();
+    let result = Solution::length_of_longest_substring(s);
     print!("{:?}", result);
 }
