跳到主要内容

Valid Palindrome II

描述​

TODO

分析​

无

代码​

// Valid Palindrome II
// Time complexity: O(n)
// Space complexity: O(1)
class Solution {
    public boolean validPalindrome(String s) {
        int i = 0;
        int j = s.length() - 1;

        while (i < j) {
            // Found a mismatched pair, try both deletions
            if (s.charAt(i) != s.charAt(j)) {
                return checkPalindrome(s, i, j - 1) || checkPalindrome(s, i + 1, j);
            }

            i++;
            j--;
        }

        return true;
    }

    private boolean checkPalindrome(String s, int i, int j) {
        while (i < j) {
            if (s.charAt(i) != s.charAt(j)) {
                return false;
            }
            i++;
            j--;
        }
        return true;
    }
}

相关题目​