698. Partition to K Equal Sum Subsets

https://leetcode.com/problems/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 1:

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.

Note:

• 1 <= k <= len(nums) <= 16.
• 0 < nums[i] < 10000.

---

算法思路：

首先确定是否可分，然后排序，确定后面需要分成几组，对于每一个元素，尝试往其中一个组中进行添加，如果所有元素都可以被分到组里面，说明可以平分。

class Solution {
public:
    bool canPartitionKSubsets(vector<int>& nums, int k) {
        int sum = accumulate(nums.begin(), nums.end(), 0);
        if(sum / k * k != sum) return false;
        
        int target = sum / k;
        sort(nums.rbegin(), nums.rend());
        if(nums[0] > target) return false;
        
        int p = 0;
        while(p < nums.size() && nums[p] == target) { p++; k--; }
        vector<int> groups(k, 0);
        
        return dfs(groups, nums, p, target);  
    }    
private:
    bool dfs(vector<int>& groups, vector<int>& nums, int p, const int& target) {
        if(p >= nums.size()) return true;
        
        int tmp = nums[p++];
        for(int i = 0; i < groups.size(); i++) {
            if(groups[i] + tmp <= target) {
                groups[i] += tmp;
                if(dfs(groups, nums, p, target)) return true;
                groups[i] -= tmp;
            }
            if(groups[i] == 0) break;
        }
        return false;   
    }
};

推荐下面这个写法，很标准 

class Solution {
public:
    bool canPartitionKSubsets(vector<int>& nums, int k) {
        int sum = accumulate(nums.begin(), nums.end(), 0);
        if (sum % k != 0) return false;
        sort(nums.begin(), nums.end());
        int target = sum / k;
        int p = nums.size() - 1;
        if (nums[p] > target) return false;
        while (p >= 0 && nums[p] == target) {
            p--;
            k--;
        }
        vector<int> groups(k, 0);
        return partition(groups, nums, p, target);
    }
private:
    bool partition(vector<int>& groups, const vector<int>& nums, int p, const int& target) {
        if (p < 0) return true;
        int tmp = nums[p];
        for (int i = 0; i < groups.size(); i++) {
            if (groups[i] + tmp <= target) {
                groups[i] += tmp;
                if (partition(groups, nums, p - 1, target)) return true;
                groups[i] -= tmp;
            }
            if (groups[i] == 0) break; //speed up
        }
        return false;
    }
};

有时间改成dp

参考资料：

https://www.bilibili.com/video/av16535336/

https://leetcode.com/problems/partition-to-k-equal-sum-subsets/solution/