Skip to content

Latest commit

 

History

History
92 lines (52 loc) · 2.15 KB

0416-partition-equal-subset-sum.adoc

File metadata and controls

92 lines (52 loc) · 2.15 KB
Raw

416. Partition Equal Subset Sum

Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.

Note:

  1. Each of the array element will not exceed 100.

  2. The array size will not exceed 200.

Example 1:
Input: [1, 5, 11, 5]

Output: true

Explanation: The array can be partitioned as [1, 5, 5] and [11].
Example 2:
Input: [1, 2, 3, 5]

Output: false

Explanation: The array cannot be partitioned into equal sum subsets.

这道题使用回溯法更容易理解，也更高效。

0416 1

思考题

  1. 将计算过程在纸上手动推演一遍；

  2. 研究一下背包问题。

参考资料

Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.

Note:

  1. Each of the array element will not exceed 100.

  2. The array size will not exceed 200.

Example 1:

Input: [1, 5, 11, 5]

Output: true

Explanation: The array can be partitioned as [1, 5, 5] and [11].

Example 2:

Input: [1, 2, 3, 5]

Output: false

Explanation: The array cannot be partitioned into equal sum subsets.
link:{sourcedir}/_0416_PartitionEqualSubsetSum.java[role=include]