LeetCode - Partition to K Equal Sum Subsets(698)

BackTracking - Medium

실패

class Solution:
    def canPartitionKSubsets(self, nums: List[int], k: int) -> bool:
        dic = {}
        
        for i in range(1, len(nums) + 1):
            combi = list(combinations(nums, i))
            for i in range(len(combi)):
                s = sum(combi[i])
                    
                if s not in dic:
                    dic[s] = 1
                else:
                    dic[s] += 1
        
        dic = list(dic.items())
        
        for i in range(len(dic)):
            if dic[i][1] == k:
                return True
            
        return False