Longest Palindromic Substring
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Example
Input: “babad”
Output: “bab”
Note: “aba” is also a valid answer.
Solution
class Solution:
def longestPalindrome(self, s: str) -> str:
ret = ''
for i in range(len(s)):
ret = max(self.helper(s,i,i), self.helper(s,i,i+1), ret, key=len)
return ret
def helper(self, s, l, r):
while l>=0 and r<len(s) and s[l]==s[r]:
l-=1
r+=1
return s[l+1:r]