LintCode 588: Partition Equal Subset Sum (背包问题好题)

588. 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.

Example
Example 1:

Input: nums = [1, 5, 11, 5],
Output: true
Explanation:
two subsets: [1, 5, 5], [11]
Example 2:

Input: nums = [1, 2, 3, 9],
Output: false
Notice
Each of the array element will not exceed 100.
The array size will not exceed 200.

解法1：转换成sum/2的01背包问题。注意用一维数组即可。
这里的dp[i]是表示能装下总共size为i的物品，1表示true, 0表示false。
最后返回dp[sum]即可。
代码如下:

class Solution {
public:
    /**
     * @param nums: a non-empty array only positive integers
     * @return: true if can partition or false
     */
    bool canPartition(vector<int> &nums) {
        int n = nums.size();
        if (n == 0) return false;
        
        long long sum = 0;
        for (int i = 0; i < n; ++i) {
            sum += nums[i];
        }
        if (sum & 0x1) return false;
        sum /= 2;
        
        vector<int> dp(sum + 1, 0);
        dp[0] = 1;
        for (int i = 0; i <= n; ++i) {
            for (int j = sum; j >= nums[i]; j--) {
                dp[j] |= dp[j - nums[i]];
            }
        }
        
        return dp[sum];
    }
};

解法2：
也可以用传统的背包办法，dp[i]表示size为j的空间最多能装多少物品。
所以最后返回dp[sum] == sum。表示size为sum的空间刚好最多装满sum。

class Solution {
public:
    /**
     * @param nums: a non-empty array only positive integers
     * @return: true if can partition or false
     */
    bool canPartition(vector<int> &nums) {
        int n = nums.size();
        if (n == 0) return false;
        
        long long sum = 0;
        for (int i = 0; i < n; ++i) {
            sum += nums[i];
        }
        if (sum & 0x1) return false;
        sum /= 2;
        
        vector<int> dp(sum + 1, 0);

        for (int i = 0; i <= n; ++i) {
            for (int j = sum; j >= nums[i]; j--) {
                //dp[j] |= dp[j - nums[i]];
                dp[j] = max(dp[j], dp[j - nums[i]] + nums[i]);
            }
        }
        
        return dp[sum] == sum;
    }
};

代码同步在
https://github.com/luqian2017/Algorithm