Skip to content

Latest commit

 

History

History
29 lines (17 loc) · 568 Bytes

File metadata and controls

29 lines (17 loc) · 568 Bytes

228.Partition Equal Subset Sum

Description

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.

Example1

Input: [1, 5, 11, 5]

Output: true

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

Example2

Input: [1, 2, 3, 5]

Output: false

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

From

LeetCode