[leetcode] 377.Combination Sum IV

Example:

nums = [1, 2, 3]
target = 4

The possible combination ways are:
(1, 1, 1, 1)
(1, 1, 2)
(1, 2, 1)
(1, 3)
(2, 1, 1)
(2, 2)
(3, 1)

Note that different sequences are counted as different combinations.

Therefore the output is 7.

Follow up:
What if negative numbers are allowed in the given array?
How does it change the problem?
What limitation we need to add to the question to allow negative numbers?

解题思路：
使用递归的方法做这个题会超时，
因此根据这道题的解法提示选择使用DP的方法，这时我们需要一个一维数组dp大小为target+1，从对应dp[i]存储的是目标i时所得的组合数，然后我们从dp[1]开始计算直到dp[target]，每次计算dp[i]时的方法是，从头开始遍历nums数组，如果i>=nums[j]， dp[i] = dp[i] + dp[i-nums[j]]，
（比如题目中的例子[1，2，3]
计算dp[1] ：
从头开始遍历nums
当j =0时 因为1 >= nums[0] 故 dp[1] = dp[1]+dp[1- nums[