Package g0601_0700.s0698_partition_to_k_equal_sum_subsets

Class Solution

java.lang.Object

g0601_0700.s0698_partition_to_k_equal_sum_subsets.Solution

public class Solution
extends Object

698 - Partition to K Equal Sum Subsets.<p>Medium</p> <p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <code>true</code> if it is possible to divide this array into <code>k</code> non-empty subsets whose sums are all equal.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [4,3,2,3,5,2,1], k = 4</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> It is possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal sums.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,4], k = 3</p> <p><strong>Output:</strong> false</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= k <= nums.length <= 16</code></li> <li><code>1 <= nums[i] <= 10⁴</code></li> <li>The frequency of each element is in the range <code>[1, 4]</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	canPartitionKSubsets(int[] nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

canPartitionKSubsets

public boolean canPartitionKSubsets(int[] nums,
 int k)