<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 validPalindrome(string s) {
        int a = 0, b = s.size() - 1;
        while(a < b) {
            if(s[a] == s[b]) {
                a++;
                b--;
            } else if(s[a] == s[b - 1] || s[a + 1] == s[b]) {
                string s1(s), s2(s);

                s1.erase(a, 1);
                s2.erase(b, 1);
                if(equal(s1.begin(), s1.end(), s1.rbegin(), s1.rend()) || 
                    equal(s2.begin(), s2.end(), s2.rbegin(), s2.rend())) {
                    return true;
                } else {
                    return false;
                }
            } else {
                return false;
            }
        }
        return true;
    }
};
24665