680. Valid Palindrome II

    bool validPalindrome(string s) {
        int left=0,right=s.size()-1,num=0;
        while(left<=right){
            if(s[left]==s[right]){
                left++;
                right--;
            }else{
                return isHuiWen(s.substr(left+1,right-left))||isHuiWen(s.substr(left,right-left));
            }
        }
        return true;
    }
    bool isHuiWen(string str){
        int left=0,right=str.size()-1;
        while(left<=right){
            if(str[left]!=str[right])
                return false;
            left++;
            right--;
        }
        return true;
    }

  bool validPalindrome(string nums) {
        int left=0,right=nums.size()-1;
        while(left<=right){
            if(nums[left]==nums[right]){
                left++;
                right--;
            }else{
                int l=left+1,r=right;
                while(l<=r){
                    if(nums[l]!=nums[r])
                        break;
                    l++;
                    r--;
                    if(l>r)
                        return true;
                }
                --right;
                while(left<=right){
                    if(nums[left]!=nums[right])
                        return false;
                    left++;
                    right--;
                }
            }
        }
        return true;
    }