72. 编辑距离

src/main.rs

@@ -1,32 +1,29 @@
-use std::collections::HashMap;
-
 mod arr;
 struct Solution {}
 impl Solution {
-    pub fn array_rank_transform(mut arr: Vec<i32>) -> Vec<i32> {
+    pub fn min_distance(word1: String, word2: String) -> i32 {
-        if arr.len() == 0 {
+        let mut dp = vec![vec![0; word2.len() + 1]; word1.len() + 1];
-            return arr;
+        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;
         }
-        let mut sorted_arr = arr.clone();
+        for i in 1..=word2.len() {
-        sorted_arr.sort_unstable();
+            dp[0][i] = dp[0][i - 1] + 1;
-        let mut mp = HashMap::with_capacity(arr.len());
+        }
-        let mut sub = 0;
+        for i in 0..word1.len() {
-        mp.insert(sorted_arr[0], 0);
+            for j in 0..word2.len() {
-        for i in 1..sorted_arr.len() {
+                dp[i + 1][j + 1] = (dp[i][j] + if word1[i] != word2[j] { 1 } else { 0 })
-            if sorted_arr[i] == sorted_arr[i-1] {
+                    .min(dp[i][j + 1] + 1)
-                sub+=1;
+                    .min(dp[i + 1][j] + 1);
-                continue;
             }
-            mp.insert(sorted_arr[i], i as i32 - sub);
         }
-        println!("{:?}", mp);
+        dp[word1.len()][word2.len()]
-        for x in arr.iter_mut() {
-             *x = *mp.get(x).unwrap() + 1;
-        }
-        arr
     }
 }
-
 fn main() {
-    println!("{:?}", Solution::array_rank_transform(vec![1,5,2,3,4,5]));
+    println!(
+        "{:?}",
+        Solution::min_distance("intention".to_string(), "execution".to_string())
+    );
 }