72. 编辑距离

src/main.rs

@@ -1,51 +1,29 @@
-use crate::arr::make_matrix;
-
 mod arr;
 struct Solution {}
 impl Solution {
-    pub fn restore_ip_addresses(s: String) -> Vec<String> {
-        let s = s
-            .chars()
-            .map(|c| (c as u8 - '0' as u8) as i32)
-            .collect::<Vec<_>>();
-        return Self::dfs(&s, 0, [-1; 4], 0);
-    }
-    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![];
+    pub fn min_distance(word1: String, word2: String) -> i32 {
+        let mut dp = vec![vec![0; word2.len() + 1]; word1.len() + 1];
+        let word1 = word1.chars().collect::<Vec<char>>();
+        let word2 = word2.chars().collect::<Vec<char>>();
+        for i in 1..=word1.len() {
+            dp[i][0] = dp[i - 1][0] + 1;
         }
-        if cur >= s.len()
-        {
-            return vec![cur_arr.map(|t| t.to_string()).join(".")];
+        for i in 1..=word2.len() {
+            dp[0][i] = dp[0][i - 1] + 1;
         }
-        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);
-                }
+        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);
             }
-            return arr;
         }
-        if cur_st < 3{
-            cur_arr[cur_st + 1] = s[cur];
-            return Self::dfs(s, cur + 1, cur_arr, cur_st + 1);
-        }
-        vec![]
+        dp[word1.len()][word2.len()]
     }
 }
 fn main() {
     println!(
         "{:?}",
-        Solution::restore_ip_addresses("0000".to_string())
+        Solution::min_distance("intention".to_string(), "execution".to_string())
     );
 }