Partition to Two Equal Sum Subsets
Consider 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.
Constraints:
- Each of the array element will not exceed
100. - The array size will not exceed
200.
Input
nums: the array
Output
if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal
Examples
Example 1:
Input:
1nums = [3, 4, 7]
Output: true
Explanation:
The array can be partitioned as [3,4] and [7].
Example 2:
Input:
1nums = [1, 5, 11, 5]
Output: true
Explanation:
The array can be partitioned as [1, 5, 5] and [11].