**Leetcode 698. Partition to K Equal Sum Subsets

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

dfs的st这个参数的剪枝，一开始没想到。。

bool cmp(const int a, const int b) {
    return a > b;
}

class Solution {
public:
    bool dfs(vector<int>&nums, int avg, int st, int k, int cur, int use, int cur_v, vector<int>&visit) {
        if (cur >= k) return true;
        if (use >= nums.size()) return false;
        bool ret = false;
        for (int i = st; i < nums.size(); i++) {
            if (!visit[i] && cur_v + nums[i] <= avg) {
                if (cur_v + nums[i] == avg) {
                    visit[i] = 1;
                    ret |= dfs(nums, avg, 0, k, cur+1, use+1, 0, visit);
                    visit[i] = 0;
                } else {
                    visit[i] = 1;
                    ret |= dfs(nums, avg, i + 1,  k, cur, use+1, cur_v + nums[i], visit);
                    visit[i] = 0;
                }
                if (ret) return true;
            }
        }
        return ret;
    }
    
    bool canPartitionKSubsets(vector<int>& nums, int k) {
        //sort(nums.begin(), nums.end(), cmp);
        if (k == 1) return true;
        int sum = 0, ji = 0;
        for (int i = 0; i < nums.size(); i++) {
            sum += nums[i];
            ji += nums[i]%2;
        }
        int avg = sum/k;
        // cout << "sum:" << sum << " ji:" << ji << endl;
        if (sum % k || nums[nums.size()-1] > avg ) return false;
        
        vector<int> visit(nums.size(), 0);
        return dfs(nums, avg, 0, k, 0, 0, 0,  visit);
        
        // return true;
    }
};