mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
Update 0072.编辑距离.md
This commit is contained in:
@ -228,7 +228,22 @@ public int minDistance(String word1, String word2) {
|
||||
```
|
||||
|
||||
Python:
|
||||
|
||||
```python
|
||||
class Solution:
|
||||
def minDistance(self, word1: str, word2: str) -> int:
|
||||
dp = [[0] * (len(word2)+1) for _ in range(len(word1)+1)]
|
||||
for i in range(len(word1)+1):
|
||||
dp[i][0] = i
|
||||
for j in range(len(word2)+1):
|
||||
dp[0][j] = j
|
||||
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-1][j], dp[i][j-1]) + 1
|
||||
return dp[-1][-1]
|
||||
```
|
||||
|
||||
Go:
|
||||
```Go
|
||||
|
Reference in New Issue
Block a user