416. Partition Equal Subset Sum

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