[LeetCode] 680. Valid Palindrome 最多删除一个字符，判断是否是回文

680. Valid Palindrome II

Easy

Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.

Example 1:

Input: "aba"
Output: True

 

Example 2:

Input: "abca"
Output: True
Explanation: You could delete the character 'c'.

 

Note:

1. The string will only contain lowercase characters a-z. The maximum length of the string is 50000.

 

笔记：

发现了新的回文判断写法 s == s[::-1]

class Solution:
    def isPalindrome(self, s: str) -> bool:
        return s == s[::-1]

    def validPalindrome(self, s: str) -> bool:
        if not self.isPalindrome(s):
            r = s[::-1]
            for i in range(len(s)):
                if r[i] != s[i]:
                    return self.isPalindrome(s[0:i] + s[i+1:]) or self.isPalindrome(r[0:i] + r[i+1:])
        return True