partition-equal-subset-sum

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>, return <code>true</code> if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or <code>false</code> otherwise.

&nbsp;
Example 1:

<pre>
Input: nums = [1,5,11,5]
Output: true
Explanation: The array can be partitioned as [1, 5, 5] and [11].
</pre>

Example 2:

<pre>
Input: nums = [1,2,3,5]
Output: false
Explanation: The array cannot be partitioned into equal sum subsets.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 200</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
</ul>

canPartition

Partition Equal Subset Sum

Partition to K Equal Sum Subsets

partition-to-k-equal-sum-subsets

划分为k个相等的子集

Minimize the Difference Between Target and Chosen Elements

minimize-the-difference-between-target-and-chosen-elements

最小化目标值与所选元素的差

Maximum Number of Ways to Partition an Array

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

分割数组的最多方案数

Partition Array Into Two Arrays to Minimize Sum Difference

partition-array-into-two-arrays-to-minimize-sum-difference

将数组分成两个数组并最小化数组和的差

Find Subarrays With Equal Sum

find-subarrays-with-equal-sum

和相等的子数组

Number of Great Partitions

number-of-great-partitions

好分区的数目

Split With Minimum Sum

split-with-minimum-sum

最小和分割

Array

Dynamic Programming

给你一个 只包含正整数 的 非空 数组 <code>nums</code> 。请你判断是否可以将这个数组分割成两个子集，使得两个子集的元素和相等。

 

示例 1：

<pre>
输入：nums = [1,5,11,5]
输出：true
解释：数组可以分割成 [1, 5, 5] 和 [11] 。</pre>

示例 2：

<pre>
输入：nums = [1,2,3,5]
输出：false
解释：数组不能分割成两个元素和相等的子集。
</pre>

 

提示：

<ul>
	<li><code>1 <= nums.length <= 200</code></li>
	<li><code>1 <= nums[i] <= 100</code></li>
</ul>