题目:698. 划分为k个相等的子集
思路:递归+剪枝
class Solution {
public:
vector<int> buckets;
bool canPartitionKSubsets(vector<int>& nums, int k) {
buckets.resize(k+1);
int n = nums.size();
int sum = 0;
for(int i=0;i<n;++i){
sum += nums[i];
}
if(sum %k !=0) return false;
sort(nums.begin(),nums.end(),std::greater<int>());
int target = sum/k;
return dfs(nums,k,0,target);
}
bool dfs(vector<int>& nums, int k, int level, int target){
int n = nums.size();
if(level >= n){
return true;
}
for(int i=0;i<k;++i){
if(i>0 && buckets[i]==buckets[i-1]){
continue;
}
if(buckets[i] + nums[level] <= target){
buckets[i] += nums[level];
if(dfs(nums, k ,level+1,target)) return true;
buckets[i] -= nums[level];
}
}
return false;
}
};