-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day 31 - Edit Distance
33 lines (33 loc) · 1.03 KB
/
Day 31 - Edit Distance
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 {
static int min(int x, int y, int z)
{
if (x <= y && x <= z)
return x;
if (y <= x && y <= z)
return y;
else
return z;
}
static int editDist(String str1, String str2, int m, int n)
{
int dp[][] = new int[m + 1][n + 1];
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0)
dp[i][j] = j;
else if (j == 0)
dp[i][j] = i;
else if (str1.charAt(i - 1) == str2.charAt(j - 1))
dp[i][j] = dp[i - 1][j - 1];
else
dp[i][j] = 1 + min(dp[i][j - 1],
dp[i - 1][j],
dp[i - 1][j - 1]);
}
}
return dp[m][n];
}
public int minDistance(String word1, String word2) {
return editDist(word1 ,word2, word1.length(), word2.length());
}
}