2996. 大于等于顺序前缀和的最小缺失整数

src/main.rs

@@ -1,21 +1,21 @@
-use std::collections::HashMap;
+use std::collections::HashSet;
 
 mod arr;
 struct Solution {}
 impl Solution {
-    pub fn max_subarray_length(nums: Vec<i32>, k: i32) -> i32 {
+    pub fn missing_integer(nums: Vec<i32>) -> i32 {
-        let mut mp = HashMap::new();
+        let mut st = nums.clone().into_iter().collect::<HashSet<i32>>();
-        let mut l: i64 = -1;
+        let mut sum = nums[0];
-        let mut ans = 0;
+        for i in 1 .. nums.len() {
-        for r in 0..nums.len() {
+            if nums[i] != nums[i-1] + 1 {
-            *mp.entry(nums[r]).or_insert(0) += 1;
+                break;
-            while *mp.get(&nums[r]).unwrap() > k {
-                l += 1;
-                *mp.get_mut(&nums[l as usize]).unwrap() -= 1
             }
-            ans = ans.max(r as i32 - l as i32);
+            sum += nums[i];
         }
-        ans
+        while st.contains(&sum) {
+            sum += 1;
+        }
+        sum
     }
 }
 fn main() {
@@ -23,6 +23,6 @@ fn main() {
     //  0  -1   0   1   0
     println!(
         "{:?}",
-        Solution::max_subarray_length(vec![1, 2, 3, 1, 2, 3, 1, 2], 2)
+        Solution::missing_integer(vec![14,9,6,9,7,9,10,4,9,9,4,4])
     );
 }