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

src/main.rs

@@ -1,51 +1,28 @@
-use crate::arr::make_matrix;
+use std::collections::HashSet;
 
 mod arr;
 struct Solution {}
 impl Solution {
-    pub fn restore_ip_addresses(s: String) -> Vec<String> {
+    pub fn missing_integer(nums: Vec<i32>) -> i32 {
-        let s = s
+        let mut st = nums.clone().into_iter().collect::<HashSet<i32>>();
-            .chars()
+        let mut sum = nums[0];
-            .map(|c| (c as u8 - '0' as u8) as i32)
+        for i in 1 .. nums.len() {
-            .collect::<Vec<_>>();
+            if nums[i] != nums[i-1] + 1 {
-        return Self::dfs(&s, 0, [-1; 4], 0);
+                break;
-    }
-    fn dfs(s: &Vec<i32>, cur: usize, mut cur_arr: [i32; 4], cur_st: usize) -> Vec<String> {
-        if s.len() - cur < 4 - cur_st - if cur_arr[cur_st] == -1 { 0 } else { 1 }
-            || ((4 - cur_st) * 3 - if cur_arr[cur_st] == -1 {0} else {cur_arr[cur_st].to_string().len()} < s.len() - cur)
-        {
-            return vec![];
-        }
-        if cur >= s.len()
-        {
-            return vec![cur_arr.map(|t| t.to_string()).join(".")];
-        }
-        if cur_arr[cur_st] == -1 {
-            cur_arr[cur_st] = s[cur];
-            return Self::dfs(s, cur + 1, cur_arr, cur_st);
-        }
-        if cur_arr[cur_st] * 10 + s[cur] <= 255 && cur_arr[cur_st] != 0 {
-            cur_arr[cur_st] = cur_arr[cur_st] * 10 + s[cur];
-            let mut arr = Self::dfs(s, cur + 1, cur_arr, cur_st);
-            if cur_st < 3 {
-                cur_arr[cur_st] /= 10;
-                cur_arr[cur_st + 1] = s[cur];
-                for t in Self::dfs(s,cur + 1, cur_arr, cur_st + 1) {
-                    arr.push(t);
-                }
             }
-            return arr;
+            sum += nums[i];
         }
-        if cur_st < 3{
+        while st.contains(&sum) {
-            cur_arr[cur_st + 1] = s[cur];
+            sum += 1;
-            return Self::dfs(s, cur + 1, cur_arr, cur_st + 1);
         }
-        vec![]
+        sum
     }
 }
 fn main() {
+    //    1   2   2   3
+    //  0  -1   0   1   0
     println!(
         "{:?}",
-        Solution::restore_ip_addresses("0000".to_string())
+        Solution::missing_integer(vec![14,9,6,9,7,9,10,4,9,9,4,4])
     );
 }