<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) {
        vector<int> erase_ids; 
        for (int k=0; k<s.size()/2; ++k) {
            if (s[k] == s[s.size() - 1 - k])    continue;
            erase_ids = {k, static_cast<int>(s.size() - 1 - k)};
            break;
        }

        if (erase_ids.empty())  return true;
        
        string s_copy = s;
        int non_matching = 0;
        for (const int erase_id : erase_ids) {
            s = s_copy;
            s.erase(erase_id,1);
            for (int k=0; k<s.size()/2; ++k) {
                if (s[k] == s[s.size() - 1 - k])    continue;
                ++non_matching;
                break;
            }

            if (non_matching == 0) return true;
            else if (non_matching == 2)  return false;
        }

        return true;
    }
};
21839