window problem

jhideki · jhideki · commit 5e835f0ecd39 · 2024-03-12T20:11:06.000-07:00
diff --git a/src/main.rs b/src/main.rs
@@ -1,8 +1,7 @@
-mod minimum_window_substring;
-use minimum_window_substring::Solution;
+mod sliding_window_max;
+use sliding_window_max::Solution;
 fn main() {
-    let s1 = "aa".to_string();
-    let s2 = "aa".to_string();
-    let result = Solution::min_window(s1, s2);
+    let nums = vec![1, 3, -1, -3, 5, 3, 6, 7];
+    let result = Solution::max_sliding_window(nums, 3);
     print!("{:?}", result);
 }
diff --git a/src/sliding_window_max.rs b/src/sliding_window_max.rs
@@ -0,0 +1,26 @@
+pub struct Solution {}
+impl Solution {
+    pub fn max_sliding_window(nums: Vec<i32>, k: i32) -> Vec<i32> {
+        use std::collections::VecDeque;
+        let mut result: Vec<i32> = Vec::new();
+        let mut max: i32 = 0;
+        let mut deque: VecDeque<usize> = VecDeque::new();
+        let mut lp = 0;
+        let mut rp: usize = 0;
+        while rp < nums.len() {
+            while !deque.is_empty() && nums[rp] > nums[*deque.front().unwrap()] {
+                deque.pop_front();
+            }
+            deque.push_front(rp);
+            if !deque.is_empty() && lp > *deque.back().unwrap() {
+                deque.pop_back();
+            }
+            if (rp + 1) as i32 >= k {
+                result.push(nums[*deque.back().unwrap()]);
+                lp += 1;
+            }
+            rp += 1;
+        }
+        result
+    }
+}
