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.

思路：首先明白，divide成k group，那么平均值就是sum / k,这就是我们每个group的targetsum，然后如果单个元素> sum / k ，或者sum % k != 0 直接return false；平分不了。然后做dfs，用k代表找到几个group；如果cursum == targetsum 表明找到一个group，k -1,继续递归，因为每个元素只能够用一次，所以用个boolean数组进行标记是否用过，如果用过跳过，否则如果cursum + nums[i] <= targetsum继续递归；

class Solution {
    public boolean canPartitionKSubsets(int[] nums, int k) {
        int totalsum = 0;
        int maxnum = nums[0];
        for(int i = 0; i < nums.length; i++) {
            totalsum += nums[i];
            maxnum = Math.max(maxnum, nums[i]);
        }
        int targetsum = totalsum / k;
        if(maxnum > targetsum || totalsum % k != 0) {
            return false;
        }
        boolean[] visited = new boolean[nums.length];
        return dfs(nums, k, 0, 0, targetsum, visited);
    }
    
    private boolean dfs(int[] nums, int k, int cursum, int index, int targetsum, boolean[] visited) {
        if(k == 0) {
            return true;
        }
        if(cursum > targetsum) {
            return false;
        }
        if(cursum == targetsum) {
            //计算到一个，下一个，从0 index开始，从0 cursum开始；
            return dfs(nums, k - 1, 0, 0, targetsum, visited);
        }
        for(int i = index; i < nums.length; i++) {
            if(visited[i]) {
                continue;
            }
            cursum += nums[i];
            visited[i] = true;
            // 如果找到了，就即可返回，不要再找了；
            if(dfs(nums, k, cursum, i + 1, targetsum, visited)) {
                return true;
            }
            visited[i] = false;
            cursum -= nums[i];
        }
        return false;
    }
}