Leetcode学习笔记（680. 验证回文字符串 Ⅱ）

简单题：双指针

class Solution {
private:
    bool funt(string s,int &begin, int &end)
    {
        while(begin<=end&&s[begin]==s[end]){
            begin++;
            end--;
        }
        if(begin>end)
            return true;
        else
            return false;
    }
public:
    bool validPalindrome(string s) {
       int begin = 0;
       int end = s.size()-1;
       if(funt(s,begin,end))
            return true;
        else{
            int new_begin = begin+1;
            int new_end = end-1;
            if(funt(s,new_begin,end)||funt(s,begin,new_end))
                return true;
        }
        return false;
    }
};