Package g0401_0500.s0416_partition_equal_subset_sum

Class Solution

java.lang.Object

g0401_0500.s0416_partition_equal_subset_sum.Solution

public class Solution
extends Object

416 - Partition Equal Subset Sum.<p>Medium</p> <p>Given a <strong>non-empty</strong> array <code>nums</code> containing <strong>only positive integers</strong> , find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,5,11,5]</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> The array can be partitioned as [1, 5, 5] and [11].</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,5]</p> <p><strong>Output:</strong> false</p> <p><strong>Explanation:</strong> The array cannot be partitioned into equal sum subsets.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 200</code></li> <li><code>1 <= nums[i] <= 100</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	canPartition(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

canPartition

public boolean canPartition(int[] nums)