Palindrome Partitioning

class Solution:

    def partition(self, s: str) -> List[List[str]]:
        if len(s) == 0:
            return []

        def check_parlindrome(string):
            if string == string[::-1]:
                return True
            else:
                return False

        def dfs(s, start, subset, result):

            if start == len(s):
                result.append(subset[:])
                return

            for i in range(start + 1, len(s) + 1):
								# 부분 문자열 추출 (start ~ 다음 인덱스)
                tmp_str = s[start:i]
                if check_parlindrome(string=tmp_str):
                    subset.append(tmp_str)
                    dfs(s=s, start=i, subset=subset, result=result)
                    subset.pop()

        subset = []
        result = []
        dfs(s, 0, subset, result)

        return result
JavaScript
복사