72. 编辑距离

src/main.rs

@@ -1,34 +1,29 @@
 mod arr;
 struct Solution {}
 impl Solution {
-    pub fn count_majority_subarrays(nums: Vec<i32>, target: i32) -> i64 {
-        let mut arr: Vec<i32> = vec![0; nums.len() + 1];
-        for i in 0..nums.len() {
-            arr[i + 1] = arr[i] + if nums[i] == target { 1 } else { -1 };
+    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;
         }
-        // [-n, n] -> [0, 2n]
-        let n = nums.len() as i32;
-        let mut pre = vec![0; nums.len() * 2 + 1];
-        let mut presum = 0;
-        let mut ans = 0;
-        println!("{:?}", arr);
-        for r in 0..nums.len() {
-            pre[(arr[r] + n) as usize] += 1;
-            if arr[r + 1] > arr[r] {
-                presum += pre[(arr[r] + n) as usize];
-            } else {
-                presum = (presum - pre[(arr[r + 1] + n) as usize]).max(0);
+        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);
             }
-            ans += presum;
         }
-        ans
+        dp[word1.len()][word2.len()]
     }
 }
 fn main() {
-    //    1   2   2   3
-    //  0  -1   0   1   0
     println!(
         "{:?}",
-        Solution::count_majority_subarrays(vec![1, 2, 2, 3], 2)
+        Solution::min_distance("intention".to_string(), "execution".to_string())
     );
 }