Leetcode 680. Valid Palindrome II

Seawolf

1. Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.
   
2. 
   
3. Example 1:
   
4. Input: "aba"
   
5. Output: True
   
6. Example 2:
   
7. Input: "abca"
   
8. Output: True
   
9. Explanation: You could delete the character 'c'.
   
10. Note:
    
11. The string will only contain lowercase characters a-z. The maximum length of the string is 50000.

复制代码

1. class Solution:
   
2.     def validPalindrome(self, s: str) -> bool:
   
3.         start = 0
   
4.         end = len(s) - 1
   
5.         
   
6.         while start <= end:
   
7.             if s[start] != s[end]:
   
8.                 first = s[start: end]
   
9.                 second = s[start + 1: end + 1]
   
10.                 return first == first[::-1] or second == second[::-1]
    
11.             start += 1
    
12.             end -= 1
    
13.             
    
14.         return True

复制代码