1147. Equal Partition Subset Sum

Given an array nums of positive integers, determine whether it can be partitioned into two subsets with equal sums. Return true or false. The input is JSON {nums}.

Input: JSON {nums}.

Output: Boolean — true or false.

Examples

Input: {"nums":[1,5,11,5]}
Output: true
Explanation: [1,5,5] and [11].

Input: {"nums":[1,2,3,5]}
Output: false
Explanation: Odd total cannot split evenly.

Input: {"nums":[2]}
Output: false
Explanation: Cannot split one element.

Constraints

• 1<=n<=200
• 1<=nums[i]<=100

Asked by