<p>Given a string <code>s</code>, return <code>true</code> <em>if the </em><code>s</code><em> can be palindrome after deleting <strong>at most one</strong> character from it</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aba&quot;
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abca&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> You could delete the character &#39;c&#39;.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abc&quot;
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

class Solution {
public:
    bool isPalindrome(string str){
        int i=0, j=str.size()-1;
        while(i<=j){
            if(str[i] != str[j])
            return false;
            i++;
            j--;
        }
        return  true;
    }
    bool validPalindrome(string s) {
        int n=s.size(), i=0, j=n-1;
        if(n==1 || n==2){
            return true;
        }
        bool canDelete = true;
        string str1="", str2="";
        while(i<=j){
            if(s[i] != s[j]){
                if(!canDelete)
                return false;
                if(canDelete){
                    if((s[i+1] == s[j]) && (s[i] == s[j-1])){
                        str1 = s.substr(i, j-i);
                        str2 = s.substr(i+1, j-i); 
                        break;
                    }
                    else if(s[i+1] == s[j]){
                        i++;
                    }else if(s[i] == s[j-1]){
                        j--;
                    }else{
                        return false;
                    }
                    canDelete = false;
                }
            }
            i++;
            j--;
        }
        if(str1 != ""){
            if(isPalindrome(str1) == false && isPalindrome(str2) == false)
            return false;
        }
        return true;
    }
};
19756