494

class Solution {
public:
    int findTargetSumWays(vector<int>& nums, int target) {
        int size=nums.size(), sum=0;
        for(int n: nums) sum+=n;
        if(target>sum || (sum+target)&1) return 0;
        int s1 = (target+sum)/2;
        vector<int> dp(s1+1, 0);
        dp[0] = 1;
        for(int i=0; i<size; i++){
            for(int j=s1; j>=nums[i]; j--){
                dp[j] += dp[j-nums[i]];
            }
        }
        return dp[s1];
    }
};