algorithm-programming
diff --git a/Collapse file
‎Dynamic Programming/LevenshteinDistance.java‎
Copy file name to clipboardExpand all lines: Dynamic Programming/LevenshteinDistance.java
+1-1Lines changed: 1 addition & 1 deletion b/Collapse file
‎Dynamic Programming/LevenshteinDistance.java‎
Copy file name to clipboardExpand all lines: Dynamic Programming/LevenshteinDistance.java
+1-1Lines changed: 1 addition & 1 deletion
@@ -25,7 +25,7 @@ private static int calculate_distance(String a, String b) {
             distance_mat[0][j] = j;
         }
         for (int i = 0; i < len_a; i++) {
-            for (int j = 0; i < len_b; j++) {
+            for (int j = 0; j < len_b; j++) {
                 int cost;
                 if (a.charAt(i) == b.charAt(j)) {
                     cost = 0;