Leetcode 680 Valid Palidrone II

题意：

判断一个字符串最多删除1个字符依旧能得到回文字符串

https://leetcode.com/problems/valid-palindrome-ii/?source=submission-noac

class Solution {
public:
    bool validPalindrome(string s) {
        int l = 0; int r = s.size()-1;
        while(l < r) {
            if(s[l] != s[r]) {
                int newl = l + 1;
                int newr = r - 1;
                return valid(s, newl, r) || valid(s, l, newr);
            }
            l++;
            r--;
        }
        return true;
    }

    bool valid(string& s, int l, int r) {
        while(l < r) {
            if(s[l] != s[r]) {
                return false;
            }
            l++;
            r--;
        }
        return true;
    }
};