680. Valid Palindrome II

Given a string s, return true if the s can be palindrome after deleting at most one character from it.

 

Example 1:

Input: s = "aba"
Output: true

Example 2:

Input: s = "abca"
Output: true
Explanation: You could delete the character 'c'.

Example 3:

Input: s = "abc"
Output: false

 

Constraints:

• 1 <= s.length <= 105
• s consists of lowercase English letters.

---

class Solution:
    def validPalindrome(self, s: str) -> bool:
        if s==s[::-1]:
            return True
        while len(s)>0 and s[0]==s[-1]:
            s=s[1:-1]
        count=0
        count= count+1 if s[1:]==s[1:][::-1] else count
        count= count+1 if s[:-1]==s[:-1][::-1] else count
        return count>0