72. 编辑距离

src/main.rs

@@ -1,44 +1,29 @@
-struct Solution;
 mod arr;
+struct Solution {}
 impl Solution {
-    fn get_product(a: i32, b: i32) -> i32 {
+    pub fn min_distance(word1: String, word2: String) -> i32 {
-        ((a as i64 * b as i64) % 12345) as i32
+        let mut dp = vec![vec![0; word2.len() + 1]; word1.len() + 1];
-    }
+        let word1 = word1.chars().collect::<Vec<char>>();
-    pub fn construct_product_matrix(mut grid: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
+        let word2 = word2.chars().collect::<Vec<char>>();
-        let mut arr = vec![0; grid.len() * grid[0].len()];
+        for i in 1..=word1.len() {
-        let mut ans = vec![0; grid.len() * grid[0].len()];
+            dp[i][0] = dp[i - 1][0] + 1;
-        for i in 0..grid.len() {
+        }
-            for j in 0..grid[0].len() {
+        for i in 1..=word2.len() {
-                arr[i * grid[0].len() + j] = grid[i][j];
+            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);
             }
         }
-        ans[0] = arr[0];
+        dp[word1.len()][word2.len()]
-        for i in 1..arr.len() {
-            ans[i] = Solution::get_product(arr[i], ans[i - 1]);
-        }
-        let mut last = arr[ans.len() - 1];
-        for i in (1..arr.len()-1).rev() {
-            let x = arr[i];
-            arr[i] = Solution::get_product(ans[i-1], last);
-            last = Solution::get_product(last, x)
-        }
-        arr[0] = last % 12345;
-        arr[ans.len() - 1] = ans[ans.len() - 2] % 12345;
-        for i in 0..grid.len() {
-            for j in 0..grid[0].len() {
-                grid[i][j] = arr[i * grid[0].len() + j];
-            }
-        }
-        grid
     }
 }
-
 fn main() {
-    let result = Solution::construct_product_matrix(arr::make_matrix(r#"[[1,2],[3,4]]"#));
+    println!(
-    println!("{:?}", result);
+        "{:?}",
+        Solution::min_distance("intention".to_string(), "execution".to_string())
+    );
 }
-/*
-[[1,4,4,0]
-,[-2,0,0,1]
-,[1,-1,1,1]]
- */