2023.10.27 Today's Challenge

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

Longest Palindromic Substring - LeetCode

브루트-포스로 푸는 문제

class Solution:
    def longestPalindrome(self, s: str) -> str:
        def check(i, j):
            l, r = i, j - 1

            while l < r:
                if s[l] != s[r]:
                    return False
                l += 1
                r -= 1
            
            return True
        
        for length in range(len(s), 0, -1):
            for start in range(len(s) - length + 1):
                if check(start, start + length):
                    return s[start:start + length]
        
        return ""