Leetcode-Python 最长回文子串

class Solution: def longestPalindrome(self, s: str) -> str: res = '' temp = {} if len(s) > 0: res = s[0] for i in range(len(s)): if s[i] not

>>阅读原文<<