LeetCode 刷题笔记 之 Partition Equal Subset Sum

题目如下：

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.

Note:

1. Each of the array element will not exceed 100.
2. The array size will not exceed 200.

Example 1:

Input: [1, 5, 11, 5]

Output: true

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

Example 2:

Input: [1, 2, 3, 5]

Output: false

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

解答如下：

定义一个一维的dp数组，其中dp[i]表示数字i是否是原数组的任意个子集合之和。初始化dp[0]为true，对于遍历到的每个数字nums[i]，我们需要更新dp数组，要更新[nums[i], target]之间的值，那么对于这个区间中的任意一个数字j，如果dp[j - nums[i]]为true的话，那么dp[j]就一定为true，于是状态转移方程如下：

dp[j] = dp[j] || dp[j - nums[i]]         (nums[i] <= j <= target)

代码：

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