LeetCode 698 Partition to K Equal Sum Subsets (dfs 剪枝)

Given an integer array nums and an integer k, return true if it is 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 is possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal sums.

Example 2:

Input: nums = [1,2,3,4], k = 3
Output: false

Constraints:

• 1 <= k <= nums.length <= 16
• 1 <= nums[i] <= 104
• The frequency of each element is in the range [1, 4].

题目链接：https://leetcode.com/problems/partition-to-k-equal-sum-subsets/

题目大意：n个数字问能不能分成k个和相等的份

题目分析：经典的搜索加剪枝问题，两个肯定不行的情况：1.总和不是k的倍数，2.最大值比均值大。搜索前需对数组从大到小排序，因为值大的数字灵活度更低，遇到无解的情况比小数字更快，由于题目限制条件明确指出每个数字可能出现的频数是1到4，当对第i个数字进行决策时，如果i-1没有选，且nums[i]和nums[i - 1]相等，那第i个位置必然不会被选

4ms，时间击败75.5%

class Solution {

    public boolean dfs(int pos, int curSum, int each, int curSz, int k, int[] nums, boolean[] vis) {
        if (curSz == k) {
            return true;
        }
        for (int i = pos; i < nums.length; i++) {
            if (i > 0 && !vis[i - 1] && nums[i] == nums[i - 1]) {
                continue;
            }
            if (!vis[i] && curSum + nums[i] <= each) {
                vis[i] = true;
                if (curSum + nums[i] == each) {
                    if (dfs(0, 0, each, curSz + 1, k, nums, vis)) {
                        return true;
                    }
                } else {
                    if (dfs(i + 1, curSum + nums[i], each, curSz, k, nums, vis)) {
                        return true;
                    }
                }
                vis[i] = false;
            }
        }
        return false;
    }
    
    public boolean canPartitionKSubsets(int[] nums, int k) {
        Arrays.sort(nums);
        int sum = 0, n = nums.length;
        for (int i = 0; i < n / 2; i++) {
            int tmp = nums[i];
            nums[i] = nums[n - i - 1];
            nums[n - i - 1] = tmp;
        }
        for (int num : nums) {
            sum += num;
        }
        if (sum % k != 0) {
            return false;
        }
        int each = sum / k;
        if (nums[0] > each) {
            return false;
        }
        boolean[] vis = new boolean[n];
        return dfs(0, 0, each, 0, k, nums, vis);
    }
}