leetcode记录5.longest-palindromic-substring

leetcode记录5.longest-palindromic-substring

Runtime: 13260 ms, faster than 5.01% of Python3 online submissions for Longest Palindromic Substring.
Memory Usage: 12.8 MB, less than 28.70% of Python3 online submissions for Longest Palindromic Substring.

class Solution:
    def longestPalindrome(self, s: str) -> str:
        index = 0
        max_len = 0
        k = 0
        for i in range(len(s)):

            for m in range(len(s) - i):
                j = len(s) - 1 - m
                length = 0
                k = i
                if (j - i) < max_len:
                    continue
                while (k <= j):
                    if s[k] == s[j] and k != j:
                        length += 2
                        k += 1
                        j -= 1
                    elif s[k] == s[j] and k == j:
                        length += 1
                        k += 1
                        j -= 1
                    else:
                        length = 1
                        break
                if length > max_len:
                    index = i
                    max_len = length

        return s[index:index + max_len]