partition-to-k-equal-sum-subsets

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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.

&nbsp;
Example 1:

<pre>
Input: nums = [4,3,2,3,5,2,1], k = 4
Output: true
Explanation: It is possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal sums.
</pre>

Example 2:

<pre>
Input: nums = [1,2,3,4], k = 3
Output: false
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= k &lt;= nums.length &lt;= 16</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 104</code></li>
	<li>The frequency of each element is in the range <code>[1, 4]</code>.</li>
</ul>

canPartitionKSubsets

Partition to K Equal Sum Subsets

Partition Equal Subset Sum

partition-equal-subset-sum

分割等和子集

Fair Distribution of Cookies

fair-distribution-of-cookies

公平分发饼干

Maximum Number of Ways to Partition an Array

maximum-number-of-ways-to-partition-an-array

分割数组的最多方案数

Maximum Rows Covered by Columns

maximum-rows-covered-by-columns

被列覆盖的最多行数

Bit Manipulation

Memoization

Array

Dynamic Programming

Backtracking

Bitmask

给定一个整数数组&nbsp;&nbsp;<code>nums</code> 和一个正整数 <code>k</code>，找出是否有可能把这个数组分成 <code>k</code> 个非空子集，其总和都相等。

&nbsp;

示例 1：

<pre>
输入： nums = [4, 3, 2, 3, 5, 2, 1], k = 4
输出： True
说明： 有可能将其分成 4 个子集（5），（1,4），（2,3），（2,3）等于总和。</pre>

示例 2:

<pre>
输入: nums = [1,2,3,4], k = 3
输出: false</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= k &lt;= len(nums) &lt;= 16</code></li>
	<li><code>0 &lt; nums[i] &lt; 10000</code></li>
	<li>每个元素的频率在 <code>[1,4]</code> 范围内</li>
</ul>