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:
class Solution:def validPalindrome(self, s):""":type s: str:rtype: bool"""l = 0;r = len(s) - 1while 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 +=1r -=1return True
680. Valid Palindrome II 有效的回文2
原文：http://www.cnblogs.com/xiejunzhao/p/7554907.html