mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-21 02:53:15 +08:00
Remove unnecessary code (#4141)
This commit is contained in:
@ -57,8 +57,8 @@ public class EditDistance {
|
||||
int insert = dp[i][j + 1] + 1;
|
||||
int delete = dp[i + 1][j] + 1;
|
||||
|
||||
int min = replace > insert ? insert : replace;
|
||||
min = delete > min ? min : delete;
|
||||
int min = Math.min(replace, insert);
|
||||
min = Math.min(delete, min);
|
||||
dp[i + 1][j + 1] = min;
|
||||
}
|
||||
}
|
||||
@ -110,13 +110,12 @@ public class EditDistance {
|
||||
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];
|
||||
}
|
||||
return storage[m][n];
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user