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

src/main.rs

@@ -1,29 +1,28 @@
+use std::collections::HashSet;
+
 mod arr;
 struct Solution {}
 impl Solution {
-    pub fn min_distance(word1: String, word2: String) -> i32 {
+    pub fn missing_integer(nums: Vec<i32>) -> i32 {
-        let mut dp = vec![vec![0; word2.len() + 1]; word1.len() + 1];
+        let mut st = nums.clone().into_iter().collect::<HashSet<i32>>();
-        let word1 = word1.chars().collect::<Vec<char>>();
+        let mut sum = nums[0];
-        let word2 = word2.chars().collect::<Vec<char>>();
+        for i in 1 .. nums.len() {
-        for i in 1..=word1.len() {
+            if nums[i] != nums[i-1] + 1 {
-            dp[i][0] = dp[i - 1][0] + 1;
+                break;
-        }
-        for i in 1..=word2.len() {
-            dp[0][i] = dp[0][i - 1] + 1;
-        }
-        for i in 0..word1.len() {
-            for j in 0..word2.len() {
-                dp[i + 1][j + 1] = (dp[i][j] + if word1[i] != word2[j] { 1 } else { 0 })
-                    .min(dp[i][j + 1] + 1)
-                    .min(dp[i + 1][j] + 1);
             }
+            sum += nums[i];
         }
-        dp[word1.len()][word2.len()]
+        while st.contains(&sum) {
+            sum += 1;
+        }
+        sum
     }
 }
 fn main() {
+    //    1   2   2   3
+    //  0  -1   0   1   0
     println!(
         "{:?}",
-        Solution::min_distance("intention".to_string(), "execution".to_string())
+        Solution::missing_integer(vec![14,9,6,9,7,9,10,4,9,9,4,4])
     );
 }