2022.04.29(LC_680_验证回文字符串 Ⅱ)

方法：双指针

class Solution {
    public boolean validPalindrome(String s) {
        for (int i = 0, j = s.length() - 1; i < j; i++, j--) {
            if (s.charAt(i) != s.charAt(j)) {
                return isValid(s, i, j - 1) || isValid(s, i + 1, j);
            }
        }
        return true;
    }
    public boolean isValid(String s, int start, int end) {
        for (int i = start, j = end; i < j; i++, j--) {
            if (s.charAt(i) != s.charAt(j)) {
                return false;
            }
        }
        return true;
    }
}