#416 Partition Equal Subset Sum

Description

Given a non-empty array nums 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.

Examples

Example 1:

Input: nums = [1,5,11,5]
Output: true
Explanation: The array can be partitioned as [1, 5, 5] and [11].

Example 2:

Input: nums = [1,2,3,5]
Output: false
Explanation: The array cannot be partitioned into equal sum subsets.

Constraints:

1 <= nums.length <= 200
1 <= nums[i] <= 100

思路

背包问题，dp的target设置为 sum(nums) / 2 就行

代码

class Solution {
    public boolean canPartition(int[] nums) {
        int count = 0;
        for (int i = 0; i < nums.length; i++)
            count += nums[i];
        
        if (count % 2 == 1)
            return false;
        
        count = count / 2;
        boolean[][] dp = new boolean[nums.length + 1][count + 1];
        
        for (int j = 0; j < count + 1; j++)
            dp[0][j] = false;
        for (int i = 0; i < nums.length + 1; i++)
            dp[i][0] = true;
        
        
        for (int i = 1; i < nums.length + 1; i++){
            for (int j = 1; j < count + 1; j++){
                dp[i][j] = dp[i - 1][j];
                if (j - nums[i - 1] >= 0)
                    dp[i][j] = dp[i - 1][j] || dp[i - 1][j - nums[i - 1]];
            }
        }
        
        return dp[nums.length][count];
    }
}