remove unnecessary condition check.
Change-Id: I6e5e3dee0ca3aae0088dcb309da8be16d3842d47main
parent
5335535871
commit
0ada663f3d
|
@ -490,8 +490,7 @@ inline static int editDistance(
|
||||||
const uint16_t cost = (ci == co) ? 0 : 1;
|
const uint16_t cost = (ci == co) ? 0 : 1;
|
||||||
dp[(i + 1) * lo + (j + 1)] = min(dp[i * lo + (j + 1)] + 1,
|
dp[(i + 1) * lo + (j + 1)] = min(dp[i * lo + (j + 1)] + 1,
|
||||||
min(dp[(i + 1) * lo + j] + 1, dp[i * lo + j] + cost));
|
min(dp[(i + 1) * lo + j] + 1, dp[i * lo + j] + cost));
|
||||||
if (li > 0 && lo > 0
|
if (ci == Dictionary::toBaseLowerCase(output[j - 1])
|
||||||
&& ci == Dictionary::toBaseLowerCase(output[j - 1])
|
|
||||||
&& co == Dictionary::toBaseLowerCase(input[i - 1])) {
|
&& co == Dictionary::toBaseLowerCase(input[i - 1])) {
|
||||||
dp[(i + 1) * lo + (j + 1)] = min(
|
dp[(i + 1) * lo + (j + 1)] = min(
|
||||||
dp[(i + 1) * lo + (j + 1)], dp[(i - 1) * lo + (j - 1)] + cost);
|
dp[(i + 1) * lo + (j + 1)], dp[(i - 1) * lo + (j - 1)] + cost);
|
||||||
|
|
Loading…
Reference in New Issue