leetcode 680 回文字符串

回文字符串

a[i] = a[len(s) - i - 1]

字符串

adca

a[2]不等于a[4 -1 - 2]

字符串

abdba

a[2]等于a[5 - 2- 1]

class Solution(object):
    def validPalindrome(self, s):
        if s==s[::-1]:
            return True
        for i in range(len(s)-1):
            if s[i] != s[len(s)-i-1]:
                return s[i+1:len(s)-i]==s[i+1:len(s)-i][::-1]