680. Valid Palindrome II 有效的回文2

Posted 2020-10-07 Long Long Journey

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.

给定一个非空字符串，您最多可以删除一个字符。判断你是否可以使它成为一个回文。

class Solution:
    def validPalindrome(self, s):
        """
        :type s: str
        :rtype: bool
        """
        l = 0;
        r = len(s) - 1
        while l < r:
            if s[l] != s[r]:
                s1,s2 = s[l:r],s[l+1:r+1]                
                return (s1 == s1[::-1]) or (s2 == s2[::-1])
            l +=1
            r -=1
        return True

来自为知笔记(Wiz)