494. Target Sum

494. Target Sum

should choose one from + and - as its new symbol.

Find out how many ways to assign symbols to make sum of integers equal to target S.

Example 1:
Input: nums is [1, 1, 1, 1, 1], S is 3.
Output: 5
Explanation:

-1+1+1+1+1 = 3
+1-1+1+1+1 = 3
+1+1-1+1+1 = 3
+1+1+1-1+1 = 3
+1+1+1+1-1 = 3

There are 5 ways to assign symbols to make the sum of nums be target 3.

Note:

The length of the given array is positive and will not exceed 20.

The sum of elements in the given array will not exceed 1000.

Your output answer is guaranteed to be fitted in a 32-bit integer.

这个题目应该算是典型的DP问题，首先分析这里的条件：数组最大长度不超过20，所有的数的和不会超过1000，这样我们就可以用2000大小的数组保存下来所有的值。

然后就是对每一层求职，然后保存下来。又因为我们需要求的是最后有多少组合，所以我们可以把每一层的相同结果的值合并，并且记录有多少个组合等于这个值，直到最后找到我们想要的值。

package main

import "fmt"

func findTargetSumWays(nums []int, S int) int {
    var resultarr [2001]int
    var resultcurr [2001]int
    resultarr[1000-nums[0]] += 1
    resultarr[1000+nums[0]] += 1
    for index, vars := range nums {
        if index == 0 {
            continue
        }
        for i := 0; i < 2000; i++ {
            if resultarr[i] != 0 {
                resultcurr[i+vars] += resultarr[i]
                resultcurr[i-vars] += resultarr[i]
            }

        }
        for i := 0; i < 2000; i++ {
            resultarr[i] = resultcurr[i]
            resultcurr[i] = 0
        }

    }
    if S > 1000 {
        return 0
    }
    return resultarr[1000+S]
}
func main() {
    var testvalue []int = []int{1, 1, 1, 1, 1}
    fmt.Println(findTargetSumWays(testvalue, 3))

}