一次编辑:
字符串有三种编辑操作:插入一个字符、删除一个字符或者替换一个字符。 给定两个字符串,编写一个函数判定它们是否只需要一次(或者零次)编辑。
作者:LeetCode-Solution
链接:https://leetcode.cn/problems/one-away-lcci/solution/yi-ci-bian-ji-by-leetcode-solution-2xkr/
来源:力扣(LeetCode)
输入:
first = “pale”
second = “ple”
输出: True
public class OneEditAway {
public static boolean oneEditAway(String first, String second) {
int m = first.length(), n = second.length();
if (n - m == 1) {
return oneInsert(first, second);
} else if (m - n == 1) {
return oneInsert(second, first);
} else if (m == n) {
boolean foundDifference = false;
for (int i = 0; i < m; i++) {
if (first.charAt(i) != second.charAt(i)) {
if (!foundDifference) {
foundDifference = true;
} else {
return false;
}
}
}
return true;
} else {
return false;
}
}
public static boolean oneInsert(String shorter, String longer) {
int length1 = shorter.length(), length2 = longer.length();
int index1 = 0, index2 = 0;
while (index1 < length1 && index2 < length2) {
if (shorter.charAt(index1) == longer.charAt(index2)) {
index1++;
}
index2++;
if (index2 - index1 > 1) {
return false;
}
}
return true;
}
public static void main(String[] args) {
oneEditAway("ab","bc");
}
}