LeetCoe 698 (Partition to K Equal Sum Subsets)
2017-10-28 22:59
519 查看
1.题目描述:
输入, 一个数组,一个整数 k, 判断是否可以将 这个数组划分为 k 个相等的子数组。
2.例子:
输入: nums = [4, 3, 2, 3, 5, 2, 1], k = 4
输出: True
解释:将 nums划分为[5], [1,4], [2,3], [2,3]4个子数组,并且和都为5。因此返回 true。
3.代码
输入, 一个数组,一个整数 k, 判断是否可以将 这个数组划分为 k 个相等的子数组。
2.例子:
输入: nums = [4, 3, 2, 3, 5, 2, 1], k = 4
输出: True
解释:将 nums划分为[5], [1,4], [2,3], [2,3]4个子数组,并且和都为5。因此返回 true。
3.代码
class Solution { public boolean canPartitionKSubsets(int[] nums, int k) { int sum = 0; int eachSum = 0; for(int num : nums) sum += num; if(sum % k != 0) return false; eachSum = sum/k; int [] boxes = new int[k]; Arrays.sort(nums); //从大到小搜索,保证数值大的每回都插入boxes中可以减少很多搜索次数 return recursive(nums, k, eachSum, index-1, boxes); } public boolean recursive(int [] nums, int k, int eachSum, int index, int [] boxes){ if(k == 0) return true; for(int i = 0; i < boxes.length; i++){ if(boxes[i] + nums[index] > eachSum){ continue; }else if(boxes[i] + nums[index] < eachSum){ boxes[i] += nums[index]; if(recursive(nums, k, eachSum, index-1, boxes)) return true; boxes[i] -= nums[index]; }else{ boxes[i] += nums[index]; if(recursive(nums, k-1, eachSum, index-1, boxes)) return true; boxes[i] -= nums[index]; } } return false; } }
相关文章推荐
- 698. Partition to K Equal Sum Subsets
- LWC 54:698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets(M)
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698 Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698[Medium]: Partition to K Equal Sum Subsets
- Partition to K Equal Sum Subsets
- [LeetCode] Partition to K Equal Sum Subsets 分割K个等和的子集
- LeetCode #698 Partition to K Equal Sum Subsets
- [LeetCode] Partition to K Equal Sum Subsets
- LeetCode#698 Partition to K Equal Sum Subsets(week19)
- LeetCode Partition to K Equal Sum Subsets
- LeetCode算法问题12 —— Partition to K Equal Sum Subsets
- Partition to K Equal Sum Subsets
- Partition to K Equal Sum Subsets