[leetcode-5] Longest Palindrome Substring

LeetCode-5

Longest Palindrome Substring : 가장 긴 Palindrome

note :

Myanswer

class Solution:
    def longestPalindrome(self, s: str) -> str:
        if len(s)==1:
            return s[0]
        for i in range(0,len(s)-1):
            for j in range(0,i+1):
                org = s[j:len(s)-(-j+i)]            
                if org[::-1]==org:
                    return org
        return org[0]

Result : 6515ms Memory: 13.9mb

Solution

class Solution:
    def longestPalindrome(self, s: str) -> str:
        def expend(left: int, right: int) -> str:
            while left >= 0 and right < len(s) and s[left] == s[right]:
                left -= 1
                right += 1
            return s[left+1:right]
        if len(s) < 2 or s == s[::-1]:
            return s
        result = ''
        for i in range(len(s)-1):
            result = max(
                result,
                expend(i, i+1),
                expend(i, i+2),
                key=len
            )
        return result

Result : 103ms Memory: 13.9mb