【LeetCode 698】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.

思路

每次从0位置凑target，凑到k个时符合题意。

代码

class Solution {
public:
    bool canPartitionKSubsets(vector<int>& nums, int k) {
        int n = nums.size();
        int sum = 0;
        for (int i=0; i<n; ++i) sum += nums[i];
        if (sum % k != 0) return false;
        vector<bool> vis(n, 0);
        return dfs(nums, k, vis, sum/k, 0, 0);
    }
    
    bool dfs(vector<int>& nums, int k, vector<bool>& vis, int target, int cur, int st) {
        if (cur == target) return dfs(nums, k-1, vis, target, 0, 0);
        if (k == 0) return true;
        if (st > nums.size()) return false;
        if (k < 0) return false;
        if (cur > target) return false;
        for (int i=st; i<nums.size(); ++i) {
            if (vis[i] == 1) continue;
            vis[i] = 1;
            if (dfs(nums, k, vis, target, cur+nums[i], i+1)) return true;
            vis[i] = 0;
        }
        
        return false;
    }
};