LeetCode #680 验证回文字符串 Ⅱ

class Solution {
   public:
    bool isRight(string s, int left, int right) {
        for (int i = left, j = right; i <= j; i++, j--) {
            if (s[i] != s[j]) {
                return false;
            }
        }
        return true;
    }

    bool validPalindrome(string s) {
        int left = 0, right = s.size() - 1;
        for (int i = left, j = right; i <= j; i++, j--) {
            if (s[i] != s[j]) {
                return isRight(s, i, j - 1) || isRight(s, i + 1, j);
            }
        }
        return true;
    }
};