-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathL698.java
More file actions
67 lines (61 loc) · 1.95 KB
/
L698.java
File metadata and controls
67 lines (61 loc) · 1.95 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package com.liang.leetcode.recursion;
import java.util.Arrays;
/**
* @ClassName: L693
* @Description: 划分为 k 个相等的子集
* @Author: LiaNg
* @Date: 2020/3/26 19:44
*/
public class L698 {
public static void main(String[] args) {
L698 l698 = new L698();
int[] nums = new int[]{10, 10, 10, 7, 7, 7, 7, 7, 7, 6, 6, 6};
int k = 3;
System.out.println("l698.canPartitionKSubsets(nums, k) = " + l698.canPartitionKSubsets(nums, k));
}
/**
* 给定一个整数数组 nums 和一个正整数 k，找出是否有可能把这个数组分成 k 个非空子集，其总和都相等。
* 注意:
* 1 <= k <= len(nums) <= 16
* 0 < nums[i] < 10000
* 来源：力扣（LeetCode）
* 链接：https://leetcode-cn.com/problems/partition-to-k-equal-sum-subsets
* 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
*/
public boolean canPartitionKSubsets(int[] nums, int k) {
int sum = Arrays.stream(nums).sum();
if (sum % k > 0) {
return false;
}
int target = sum / k;
Arrays.sort(nums);
int row = nums.length - 1;
if (nums[row] > target) {
return false;
}
while (row >= 0 && nums[row] == target) {
row--;
k--;
}
return search(new int[k], row, nums, target);
}
public boolean search(int[] groups, int row, int[] nums, int target) {
if (row < 0) {
return true;
}
int v = nums[row--];
for (int i = 0; i < groups.length; i++) {
if (groups[i] + v <= target) {
groups[i] += v;
if (search(groups, row, nums, target)) {
return true;
}
groups[i] -= v;
}
if (groups[i] == 0) {
break;
}
}
return false;
}
}