algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 17:56:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: format code (#4212)

Browse Source 
close #4204
This commit is contained in:
acbin
2023-06-09 18:52:05 +08:00
committed by GitHub
parent ad03086f54
commit 00282efd8b
521 changed files with 5233 additions and 7309 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
src/main/java/com/thealgorithms/dynamicprogramming/LevenshteinDistance.java
View File

@ -32,12 +32,9 @@ public class LevenshteinDistance {
if (str1.charAt(i - 1) == str2.charAt(j - 1)) {
distanceMat[i][j] = distanceMat[i - 1][j - 1];
} else {
distanceMat[i][j] =
1 + minimum(
distanceMat[i - 1][j],
distanceMat[i - 1][j - 1],
distanceMat[i][j - 1]
);
distanceMat[i][j] = 1
+ minimum(distanceMat[i - 1][j], distanceMat[i - 1][j - 1],
distanceMat[i][j - 1]);
}
}
}
@ -48,9 +45,7 @@ public class LevenshteinDistance {
String str1 = ""; // enter your string here
String str2 = ""; // enter your string here
System.out.print(
"Levenshtein distance between " + str1 + " and " + str2 + " is: "
);
System.out.print("Levenshtein distance between " + str1 + " and " + str2 + " is: ");
System.out.println(calculateLevenshteinDistance(str1, str2));
}
}