README_EN.md

698. Partition to K Equal Sum Subsets

中文文档

Description

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, 2, 1], k = 4

Output: True

Explanation: It's possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal sums.

 

Note:

<li><code>1 &lt;= k &lt;= len(nums) &lt;= 16</code>.</li>

<li><code>0 &lt; nums[i] &lt; 10000</code>.</li>

Solutions

Python3

Java

...