leetcode5 回文字

def longestPalindrome(s):
    n = len(s)
    maxl = 0
    start = 0
    for i in range(n):
        if i - maxl >= 1 and s[i - maxl - 1: i + 1] == s[i - maxl - 1: i + 1][::-1]:
            start = i - maxl - 1
            maxl += 2
            continue
        if i - maxl >= 0 and s[i - maxl: i + 1] == s[i - maxl: i + 1][::-1]:
            start = i - maxl
            maxl += 1
    print( s[start: start + maxl])
if __name__ == '__main__':
    s="babad"
    n = len(s)
    longestPalindrome(s)

原文地址：https://www.baidu.com/link?url=Ud5BBbuG4dta-t0KL-7duQSutKSadg0pMtr3tSIUM0RtLam2MG2AOn_hUeY3R51Z9IBoY5oTwsUl3gpvdLhU5XocZ-KtIq6ZYZhC4AXy3w_&wd=&eqid=81e904b900015105000000025cb98178