72

Author: ProHiryu

DP/traditionalDP/72.md

@@ -0,0 +1,38 @@
+## Edit Distance
+
+#### Description
+
+[link](https://zhuanlan.zhihu.com/p/80682302)
+
+---
+
+#### Solution
+
+https://zhuanlan.zhihu.com/p/80682302
+
+---
+
+#### Code
+
+> Complexity T : O(mn) M : O(mn)
+
+```python
+class Solution:
+    def minDistance(self, word1: str, word2: str) -> int:
+        dp = [[float('inf') for _ in range(len(word2) + 1)] for _ in range(len(word1) + 1)]
+
+        for i in range(1 ,len(word1) + 1):
+            dp[i][0] = i
+        for j in range(1 ,len(word2) + 1):
+            dp[0][j] = j
+        
+        dp[0][0] = 0
+
+        for i in range(1, len(word1) + 1):
+            for j in range(1, len(word2) + 1):
+                if word1[i - 1] == word2[j - 1]:
+                    dp[i][j] = dp[i - 1][j - 1]
+                else:
+                    dp[i][j] = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1)
+        return dp[len(word1)][len(word2)]
+```