[leetcode]416. Partition Equal Subset Sum

[leetcode]416. Partition Equal Subset Sum

---

Analysis

完了完了 真的要找不到工作了！！！！！苍了天了！！！—— [每天刷题并不难0.0]

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:
Each of the array element will not exceed 100.
The array size will not exceed 200.

动态规划解决，这题还是蛮有意思的~要二刷

Implement

class Solution {
public:
    bool canPartition(vector<int>& nums) {
        int sum = accumulate(nums.begin(), nums.end(), 0);
        int target = sum>>1;
        if(sum & 1)
            return false;
        vector<int> dp(target+1, 0);
        dp[0] = 1;
        for(int num:nums){
            for(int i=target; i>=num; i--)
                dp[i] = dp[i]||dp[i-num];
        }
        return dp[target];
    }
};