LeetCode 416. 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.

方法一：记忆化搜索

class Solution {
private:
    // memo[i][c] 表示使用索引为[0...i]的这些元素,是否可以完全填充一个容量为c的背包
    // -1 表示为未计算; 0 表示不可以填充; 1 表示可以填充
    vector<vector<int>> memo;
    bool tryPartition(const vector<int>& nums,int index,int sum) {
        // 填充容量为sum的背包
        
        // 背包里没有任何空间
        if (sum == 0) return true;
        
        // 填充的物品多了 || 无物品可选，但背包里还有空间
        if (sum <= 0 || index < 0) return false;
        
        if (memo[index][sum] != -1) return memo[index][sum] == 1;
        
        // 尝试用[0...index-1]这些nums填充大小为sum的背包
        memo[index][sum] = (tryPartition(nums,index-1,sum) || tryPartition(nums,index-1,sum - nums[index])) ? 1 : 0;
        return memo[index][sum] == 1;
    }
public:
    // 背包问题
    bool canPartition(vector<int>& nums) {
        
        int sum = 0;
        for (int i=0; i<nums.size(); i++) {
            assert(nums[i] > 0);
            sum += nums[i];
        }
        
        if (sum%2 != 0) return false;
        memo = vector<vector<int>>(nums.size(),vector<int>(sum/2+1,-1));
        return tryPartition(nums,nums.size()-1,sum/2);
    }
};

方法二：动态规划

class Solution {
    
public:
    // 背包问题
    bool canPartition(vector<int>& nums) {
        
        int sum = 0;
        for (int i=0; i<nums.size(); i++) {
            assert(nums[i] > 0);
            sum += nums[i];
        }
        
        if (sum%2 != 0) return false;
        
        int n = nums.size();
        // 背包容量
        int C = sum/2;
        vector<int> memo(C+1,false);
        
        // 如果只考虑第一个nums，能否把memo相对应的背包填满
        for (int i=0; i<=C; i++)
            memo[i] = (nums[0] == i);
        
        // 每一次多考虑一个数
        for (int i=1; i<n; i++) 
            for (int j=C; j>=nums[i]; j--) 
                memo[j] = memo[j] || memo[j-nums[i]];
        
        return memo[C];
    }
};