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.

分析：

Assume sum is the sum of nums[] . The dfs process is to find a subset of nums[] which sum equals to sum/k. We use an array visited[] to record which element in nums[] is used. Each time when we get a cur_sum = sum/k, we will start from position 0 in nums[] to look up the elements that are not used yet and find another cur_sum = sum/k.

 class Solution {
     public boolean canPartitionKSubsets(int[] nums, int k) {
         int sum = ;
         for (int num : nums) sum += num;
         if (k <=  || sum % k != ) return false;
         int[] visited = new int[nums.length];
         return canPartition(nums, visited, , k, , , sum / k);
     }

     public boolean canPartition(int[] nums, int[] visited, int start_index, int k, int cur_sum, int cur_num, int target) {
         if (k == ) return true;
         if (cur_sum > target) return false;
         if (cur_sum == target && cur_num > 0) return canPartition(nums, visited, , k - , , , target);
         for (int i = start_index; i < nums.length; i++) {
             if (visited[i] == ) {
                 visited[i] = ;
                 if (canPartition(nums, visited, i + , k, cur_sum + nums[i], cur_num++, target)) {
                     return true;
                 }
                 visited[i] = ;
             }
         }
         return false;
     }
 }