Last active
August 29, 2015 14:02
-
-
Save gabhi/27ab7f6d37435333cb16 to your computer and use it in GitHub Desktop.
Edit distance
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public static int minDistance(String word1, String word2) { | |
int len1 = word1.length(); | |
int len2 = word2.length(); | |
// len1+1, len2+1, because finally return dp[len1][len2] | |
int[][] dp = new int[len1 + 1][len2 + 1]; | |
for (int i = 0; i <= len1; i++) { | |
dp[i][0] = i; | |
} | |
for (int j = 0; j <= len2; j++) { | |
dp[0][j] = j; | |
} | |
//iterate though, and check last char | |
for (int i = 0; i < len1; i++) { | |
char c1 = word1.charAt(i); | |
for (int j = 0; j < len2; j++) { | |
char c2 = word2.charAt(j); | |
//if last two chars equal | |
if (c1 == c2) { | |
//update dp value for +1 length | |
dp[i + 1][j + 1] = dp[i][j]; | |
} else { | |
int replace = dp[i][j] + 1; | |
int insert = dp[i][j + 1] + 1; | |
int delete = dp[i + 1][j] + 1; | |
int min = replace > insert ? insert : replace; | |
min = delete > min ? min : delete; | |
dp[i + 1][j + 1] = min; | |
} | |
} | |
} | |
return dp[len1][len2]; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment