leetcode-python-最长回文串

class Solution:
    def longestPalindrome(self, s: str) -> str:
        length = len(s)
        maxlength = 0
        for i in range(length):
            l = i
            r = i
            while l >= 0 and r < length and s[l] == s[r]:
                if maxlength < len(s[l:r+1]):
                    maxlength = len(s[l:r+1])
                    result = s[l:r+1]
                l -= 1
                r += 1
            l = i
            r = i+1
            while l >= 0 and r < length and s[l] == s[r]:
                if maxlength < len(s[l:r+1]):
                    maxlength = len(s[l:r+1])
                    result = s[l:r+1]
                l -= 1
                r += 1
        return result