找最长回文子串

暴力法

def longestPalindrome(s: str):
    length = len(s)
    string = ''
    max = 0
    if length == 0:
        return 'None'
    elif length == 1:
        return s
    else:
        for index in range(length):  # 对字符串的循环，对每一个字进行循环
            for check in range(0, index + 1):
                if s[index] == s[check]:
                    i = index - 1
                    j = check + 1
                    while i > j:
                        if s[i] != s[j]:
                            break
                        i -= 1
                        j += 1
                    else:
                        if index - check + 1 > max:
                            max = index - check + 1
                            string = s[check:index + 1]
        return max, string


string = 'aaaaaaaaaaaaaaaaaaa'
print(longestPalindrome(string))

中心扩展算法

def longestPalindrome(s: str):
    if s == None or len(s) < 1:
        return ""
    start = end = 0
    for i in range(len(s)):
        len1 = expandAroundCenter(s, i, i)
        len2 = expandAroundCenter(s, i, i + 1)
        length = max(len1, len2)
        if length > end - start:
            start = i - (length - 1) // 2
            end = i + length // 2
    return s[start:end + 1], end + 1 - start


def expandAroundCenter(s, left, right):
    L = left
    R = right
    while L >= 0 and R < len(s) and s[L] == s[R]:
        L -= 1
        R += 1
    return R - L - 1