680. Valid Palindrome II

[Tcdian]

680. Valid Palindrome II

给定一个非空字符串 s，最多 删除一个字符。判断是否能成为回文字符串。

Example 1

Input: "aba"
Output: True

Example 2

Input: "abca"
Output: True
Explanation: You could delete the character 'c'.

Note

• 字符串只包含从 a-z 的小写字母。字符串的最大长度是50000。

[Tcdian]

Solution

• JavaScript Solution

/**
 * @param {string} s
 * @return {boolean}
 */
var validPalindrome = function(s) {
    let chance = 1;
    return isPalindrome(s);
    function isPalindrome(s) {
        let left = 0;
        let right = s.length - 1;
        while (left < right) {
            if (s[left] !== s[right]) {
                if (chance > 0) {
                    chance--;
                    return isPalindrome(s.slice(0, left) + s.slice(left + 1))
                        || isPalindrome(s.slice(0, right) + s.slice(right + 1));
                } else {
                    return false;
                }
            }
            left++;
            right--;
        }
        return true;
    }
};