java求数组中满足给定和的数对,数组中满足和为给定值的子序列（可重复）Combination Sum IV...

问题：

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?

解决：

① 设dp[i]表示目标为i的解的个数。对于目标target，dp[target] = dp[i] + dp[target - i]。

class Solution { //6ms

public int combinationSum4(int[] nums, int target) {

int[] dp = new int[target + 1];

dp[0] = 1;

for (int i = 1;i <= target;i ++){

for (int n : nums){

if (i >= n){

dp[i] = dp[i] + dp[i - n];

}

}

}

return dp[target];

}

}

② 优化

class Solution { //4ms

public int combinationSum4(int[] nums, int target) {

int[] dp = new int[target + 1];

dp[0] = 1;

Arrays.sort(nums);

for (int i = 1;i <= target;i ++){

for (int n : nums){

if (i < n) break;

dp[i] = dp[i] + dp[i - n];

}

}

return dp[target];

}

}

③ 递归+动态规划

class Solution { //1ms

public int combinationSum4(int[] nums, int target) {

int[] dp = new int[target + 1];

Arrays.fill(dp,-1);

dp[0] = 1;

return combinationSum4(nums,target,dp);

}

public int combinationSum4(int[] nums,int target,int[] dp){

if (dp[target] != -1){

return dp[target];

}

int res = 0;

for (int i = 0;i < nums.length;i ++){

if (target >= nums[i]){

res += combinationSum4(nums,target - nums[i],dp);

}

}

dp[target] = res;

return res;

}

}