package LeetCode;

import java.util.Arrays;

public class LC_494 {
    public int findTargetSumWays(int[] nums, int target) {
        int sum = Arrays.stream(nums).sum();
        if (sum < -target) return 0;
        if ((sum + target) % 2 != 0) return 0;
        int bageSize = (sum + target) / 2;
        int[] dp = new int[bageSize + 1];
        dp[0] = 1;
        for (int i = 0; i < nums.length; i++) {
            for (int j = bageSize; j >= nums[i]; j--) {
                dp[j] += dp[j - nums[i]];
            }
        }
        return dp[bageSize];
    }
}