leetcode 5 (medium)

문제

https://leetcode.com/problems/longest-palindromic-substring/

내 풀이

class Solution:
    def longestPalindrome(self, s: str) -> str:
        
        max_len = 1
        answer = s[0] if len(s) >0 else ''
        
        def check(arr):
            return True if arr == arr[::-1] else False

        
        for i in range(len(s)-1):
            
            a = i
            b = i+1
            
            while(a >= 0 and b < len(s)):
                if check(s[a:b+1]):
                    if len(s[a:b+1]) > max_len:
                        max_len = len(s[a:b+1])
                        answer = s[a:b+1]
                        
                    a -= 1
                    b += 1
                        
                else :
                    break
                    
            a = i
            b = i
            
            while(a >=0 and b < len(s)):
                if check(s[a:b+1]):
                    if len(s[a:b+1]) > max_len:
                        max_len = len(s[a:b+1])
                        answer = s[a:b+1]
                        
                    a -= 1
                    b += 1
                        
                else :
                    break
                    
        return answer
      

결과