[LeetCode]Partition to K Equal Sum Subsets@Python

最新推荐文章于 2024-09-09 14:10:45 发布

Goofiness

最新推荐文章于 2024-09-09 14:10:45 发布

阅读量211

点赞数

分类专栏： leetcode depth-first-search 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/100926017

版权

leetcode 同时被 2 个专栏收录

232 篇文章

订阅专栏

depth-first-search

5 篇文章

订阅专栏

本文探讨了PartitiontoKEqualSumSubsets问题，即判断是否能将整数数组划分为k个子集，每个子集的和相等。通过深度优先搜索(DFS)结合回溯算法实现解决方案，并讨论了状态压缩DP方法的使用，为读者提供了一个清晰的算法思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Partition to K Equal Sum Subsets
Given an array of integers nums and a positive integer k, find whether it’s possible to divide this array into k non-empty subsets whose sums are all equal.

Example

Input: nums = [4, 3, 2, 3, 5, 2, 1], k = 4
Output: True
Explanation: It’s possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal sums.

Solution
看别人说DP用bitmasking做，但暂时没太看明白

class Solution:
    def canPartitionKSubsets(self, nums: List[int], k: int) -> bool:
        def dfs(index):
            if index==len(nums):
                return len(set(buck))== 1
            for i in range(k):
                print('i=%d'%(i),'index=%d'%(index))
                print(buck[i])
                buck[i] += nums[index]
                print(buck[i])
                if buck[i]<= nsum//k and dfs(index+1):
                    return True
                buck[i] -= nums[index]
                if buck[i]==0:
                    break
            return False
            
        nums.sort(reverse=True)
        nsum = sum(nums)
        if nsum%k != 0:
            return False
        if nums[0] > nsum//k:
            return False
        buck = [0]*k
        return dfs(0)