Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add Edit Distance with recursion (#2686)

Browse Source
This commit is contained in:
Tejbirsingh7878 2021-10-24 16:46:51 +05:30 committed by GitHub
parent b608657e50
commit 793bedb699
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 38 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
DynamicProgramming/EditDistance.java
View File

@ -77,4 +77,42 @@ public class EditDistance {
"The minimum Edit Distance between \"" + s1 + "\" and \"" + s2 + "\" is " + ans);
input.close();
}
// edit distance problem
public static int editDistance(String s1, String s2){
int[][] storage = new int[s1.length() + 1][s2.length() + 1];
return editDistance(s1, s2,storage);
}
public static int editDistance(String s1, String s2, int[][] storage) {
int m = s1.length();
int n = s2.length();
if (storage[m][n] > 0) {
return storage[m][n];
}
if (m== 0) {
storage[m][n] = n;
return storage[m][n];
}
if (n== 0) {
storage[m][n] = m;
return storage[m][n];
}
if (s1.charAt(0) == s2.charAt(0)) {
storage[m][n] = editDistance(s1.substring(1), s2.substring(1), storage);
return storage[m][n];
} else {
int op1 = editDistance(s1, s2.substring(1),storage);
int op2 = editDistance(s1.substring(1), s2,storage);
int op3 = editDistance(s1.substring(1),s2.substring(1),storage);
storage[m][n] = 1 + Math.min(op1, Math.min(op2, op3));
return storage[m][n];
}
}
}