-
Notifications
You must be signed in to change notification settings - Fork 0
/
EditDistance.java
51 lines (38 loc) · 1.12 KB
/
EditDistance.java
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
package com.leetcode.MayChallenge.week5;
/**
* @author Shrinath Joshi
*
* Time Complexity :- O(n*m)
*
* Space Complexity :- O(n*m)
*
*/
public class EditDistance {
// Bottom Up Approach
public int minDistance(String word1, String word2) {
int len1 = word1.length();
int len2 = word2.length();
int dp[][] = new int[len1 + 1][len2 + 1];
for (int i = 0; i <= len1; i++)
dp[i][0] = i;
for (int i = 0; i <= len2; i++)
dp[0][i] = i;
for (int i = 1; i <= len1; i++) {
for (int j = 1; j <= len2; j++) {
if (word1.charAt(i - 1) == word2.charAt(j - 1))
dp[i][j] = dp[i - 1][j - 1];
else
dp[i][j] = 1 + Math.min(dp[i - 1][j], Math.min(dp[i - 1][j - 1], dp[i][j - 1]));
}
}
return dp[len1][len2];
}
public static void main(String[] args) {
String word1 = "intention", word2 = "execution";
System.out.println(new EditDistance().minDistance(word1, word2));
String word3 = "horse", word4 = "ros";
System.out.println(new EditDistance().minDistance(word3, word4));
String word5 = "", word6 = "r";
System.out.println(new EditDistance().minDistance(word5, word6));
}
}