#377 Combination Sum IV

Description

Given an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target.

The test cases are generated so that the answer can fit in a 32-bit integer.

Examples

Example 1:

Input: nums = [1,2,3], target = 4
Output: 7
Explanation:
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.

Example 2:

Input: nums = [9], target = 3
Output: 0

Constraints:

1 <= nums.length <= 200
1 <= nums[i] <= 1000
All the elements of nums are unique.
1 <= target <= 1000

思路

这次要注意的是采用的dp不是二维dp，而是一维dp，先固定住target，然后依次看这些数组可以有多少种方式构成target，dp里面存的就是target=i时候的可能路径条数

代码

class Solution {
    public int combinationSum4(int[] nums, int target) {
        int[] dp = new int[target + 1];
        dp[0] = 1;
        
        for (int i = 1; i < target + 1; i++){
            for (int j = 0; j < nums.length; j++){
                if (i - nums[j] >= 0)
                    dp[i] += dp[i - nums[j]];
            }
        }
        
        return dp[target];
    }
}