剑指-019

class Solution {
    public boolean validPalindrome(String s) {
        int len = s.length();
        int left = 0;
        int right = len - 1;
        while(left < right){
            if(s.charAt(left) == s.charAt(right)){
                left++;
                right--;
            }else{
                return isHuiwen(s, left, right - 1) || isHuiwen(s, left + 1, right);
            }
        }
        return true;
    }
    public boolean isHuiwen(String s, int left, int right){
        for(;left < right; left++,right--){
            if(s.charAt(left) != s.charAt(right)){
                return false;
            }
        }
        return true;
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24