Fork me on GitHub

Partition Equal Subset Sum

Posted on

Description

https://leetcode.com/problems/partition-equal-subset-sum/description/

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
class Solution {
public:
    bool canPartition(vector<int>& nums) {
        int size = nums.size();
        if (size == 0 || size == 1) return false;
        int sum = 0;
        for (int i = 0; i < size; i++) sum += nums[i];
        
        if (sum % 2 == 1) return false;
        int target = sum / 2;
        vector<vector<bool>> dp(size + 1, vector<bool>(target+1, false));
        for (int i = 0; i <= size; i++) dp[i][0] = true;
            
        for (int i = 1; i <= size; i++) {
            for(int amount = nums[i - 1]; amount <= target; ++amount)
                if(dp[i - 1][amount - nums[i - 1]]) {
                    dp[i][amount] = true;
                    dp[i][amount - nums[i - 1]] = true;
                }
            if (dp[i][target]) return true;
        }
        return false;
    }
};