# 动态规划-377-Combination Sum IV

xiaoxiao2021-02-28  13

Description: Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.

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?

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

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