Day36 动态规划

416. 分割等和子集

class Solution {
public:
    bool canPartition(vector<int>& nums) {
        int sum = accumulate(nums.begin(), nums.end(), 0);
        
        if (sum % 2 == 1) return false;
        int target = sum / 2;

        vector<int> dp(10001, 0);

        for (int i = 0; i < nums.size(); i++) {
            for (int j = target; j >= nums[i]; j--) {
                dp[j] = max (dp[j], dp[j-nums[i]] + nums[i]);
                // std::cout << "j: " << j << ", dp[j]: " << dp[j] << std::endl;
            }
        }

        return (dp[target] == target ? true : false);
    }
};