Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution:
- def longestPalindrome(self, s: str) -> str:
- if not s:
- return ""
- def expand_around_center(s: str, left: int, right: int):
- while left >= 0 and right < len(s) and s[left] == s[right]:
- left -= 1
- right += 1
- return right - left - 1
- start = 0
- end = 0
- for i in range(len(s)):
- odd = expand_around_center(s, i, i)
- even = expand_around_center(s, i, i + 1)
- max_len = max(odd, even)
- if max_len > end - start:
- start = i - (max_len - 1) // 2
- end = i + max_len // 2
- return s[start:end+1]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement