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,...
原创
2018-08-21 00:09:51 ·
175 阅读 ·
0 评论