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

Merge branch 'master' of https://github.com/freitzzz/Java

Browse Source 
# Conflicts:
#	Data Structures/HashMap/HashMap.java
#	Huffman.java
#	Misc/FloydTriangle.java
#	Misc/Huffman.java
#	Misc/InsertDeleteInArray.java
#	Misc/RootPrecision.java
#	Misc/ft.java
#	Misc/root_precision.java
#	Others/FloydTriangle.java
#	Others/Huffman.java
#	Others/insert_delete_in_array.java
#	Others/root_precision.java
#	insert_delete_in_array.java
This commit is contained in:
DESKTOP-0VAEMFL\joaom
2017-10-28 12:59:58 +01:00
parent 467b917416 7e3a8c55c8
commit 20d0bb2c69
58 changed files with 2697 additions and 114 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Dynamic Programming/LevenshteinDistance.java
View File

@ -7,7 +7,7 @@
*/
public class Levenshtein_distance{
private int minimum(int a, int b, int c){
private static int minimum(int a, int b, int c){
if(a < b && a < c){
return a;
}else if(b < a && b < c){
@ -16,9 +16,9 @@ public class Levenshtein_distance{
return c;
}
}
public int calculate_distance(String a, String b){
len_a = a.length() + 1;
len_b = b.length() + 1;
private static int calculate_distance(String a, String b){
int len_a = a.length() + 1;
int len_b = b.length() + 1;
int [][] distance_mat = new int[len_a][len_b];
for(int i = 0; i < len_a; i++){
distance_mat[i][0] = i;