680. Valid Palindrome II 有效的回文2

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.

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

1. class Solution:
2. def validPalindrome(self, s):
3. """
4. :type s: str
5. :rtype: bool
6. """
7. l = 0;
8. r = len(s) - 1
9. while l < r:
10. if s[l] != s[r]:
11. s1,s2 = s[l:r],s[l+1:r+1]
12. return (s1 == s1[::-1]) or (s2 == s2[::-1])
13. l +=1
14. r -=1
15. return True

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/xiejunzhao/p/7554907.html