forked from wisdompeak/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path072.Edit-Distance.cpp
33 lines (29 loc) · 902 Bytes
/
072.Edit-Distance.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
class Solution {
public:
int minDistance(string word1, string word2)
{
int n1=word1.size();
int n2=word2.size();
word1.insert(word1.begin(),'0');
word2.insert(word2.begin(),'0');
auto dp=vector<vector<int>>(n1+1,vector<int>(n2+1,INT_MAX));
dp[0][0]=0;
for (int i=1; i<=n1; i++)
dp[i][0]=i;
for (int j=1; j<=n2; j++)
dp[0][j]=j;
for (int i=1; i<=n1; i++)
for (int j=1; j<=n2; j++)
{
if (word1[i]==word2[j])
dp[i][j]=dp[i-1][j-1];
else
{
dp[i][j]=min(dp[i][j],dp[i-1][j]+1);
dp[i][j]=min(dp[i][j],dp[i][j-1]+1);
dp[i][j]=min(dp[i][j],dp[i-1][j-1]+1);
}
}
return dp[n1][n2];
}
};