Valid Palindrome II

class Solution {
public:
    int count=0;
    int left;
    int right;

    bool validPalindrome(string s) {
        left = 0;
        right = s.length()-1;
        int curCost = 0;

        while(left!=right && left<right){
            if(s[left]==s[right]){
                left++;
                right--;
            }else{
                if(checkPalindrome(s,left+1,right) ||checkPalindrome(s,left,right-1)){
                    return true;
                }else{
                    return false;
                }
            }
        }
        return true;
    }
    bool checkPalindrome(string s, int start, int end){
        while(start!=end && start<end){
            if(s[start]!=s[end]) return false;
            start++;
            end--;
        }
        return true;
    }

};