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: trueExplanation: The array can be partitioned as [1, 5, 5] and [11].

Example 2:

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

class Solution {public:    bool canPartition(vector<int>& nums) {        int sum = accumulate(nums.begin(), nums.end(), 0);        if (sum % 2 == 1) return false;        int record = sum / 2;        vector<bool> dp(recorf + 1, false);        dp[0] = true;        for (int i = 0; i < nums.size(); ++i) {            for (int j = record; j >= nums[i]; --j) {                dp[j] = dp[j] || dp[j - nums[i]];            }        }        return dp.back();    }};

class Solution {public:    bool canPartition(vector<int>& nums) {        int sum = accumulate(nums.begin(), nums.end(), 0);        if (sum % 2 == 1) return false;        int record = sum / 2;        vector<bool> dp(recorf + 1, false);        dp[0] = true;        for (int i = 0; i < nums.size(); ++i) {            for (int j = record; j >= nums[i]; --j) {                dp[j] = dp[j] || dp[j - nums[i]];            }        }        return dp.back();    }};