Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ffd4521 commit 8626309Copy full SHA for 8626309
Dynamic Programming/LevenshteinDistance.java
@@ -25,7 +25,7 @@ private static int calculate_distance(String a, String b) {
25
distance_mat[0][j] = j;
26
}
27
for (int i = 0; i < len_a; i++) {
28
- for (int j = 0; i < len_b; j++) {
+ for (int j = 0; j < len_b; j++) {
29
int cost;
30
if (a.charAt(i) == b.charAt(j)) {
31
cost = 0;
0 commit comments