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:
Each of the array element will not exceed 100.
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 {
public:
    bool canPartition(vector<int>& nums) {
        int sum = accumulate(nums.begin(), nums.end(), 0);
        if (sum & 1) return false;
        int half = sum >> 1;

        vector<bool> dp(half + 1, false);
        dp[0] = true;
        for(auto num : nums)  
            for(int i = half; i >= num; i--) {
                if (dp[i - num] == true){
                    dp[i] = true;
                }
            }
        return dp[half];
    }
};