Given a string s, return true if the s can be palindrome after deleting at most one character from it.
Example 1:
Input: s = “aba”
Output: true
Example 2:
Input: s = “abca”
Output: true
Explanation: You could delete the character ‘c’.
Example 3:
Input: s = “abc”
Output: false
判断字符串s是否是有效的回文字符串,s最多可删掉一个字符。
思路:
左右指针,递归。
回文字符串的特点是对称,s[i] == s[n-i]。
当s[i] != s[n-i]时,并不马上判断是无效的,而是删掉左边或右边的一个字符,再递归判断,
由于只能删除一个字符,等到第二次s[i] != s[n-i]时,就要判断无效了。
当左右指针相遇时,返回true。
public boolean validPalindrome(String s) {
return isValid(s, 0, s.length() - 1, false);
}
boolean isValid(String s, int left, int right, boolean deleted) {
while(left < right) {
if(s.charAt(left) != s.charAt(right)) {
if(deleted) return false;
return isValid(s, left + 1, right, true) || isValid(s, left, right - 1, true);
}
left ++;
right --;
}
return true;
}