题目链接:
https://leetcode.com/problems/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,dp[i]表示当target为i 时,有多少种组合。
状态转移方程:dp[i]=Σdp[i-nums[k]] 0<=k<=nums.length
当然,需要考虑当i-nums[k]为0时,表示数组中有target,则此时dp[i]为1,
时间复杂度O(n^2)
算法:
public int combinationSum4(int[] nums, int target) {
int dp[] = new int[target + 1];
for (int i = 0; i <= target; i++) {
for (int k = 0; k < nums.length; k++) {
if (i - nums[k] > 0) {
dp[i] += dp[i - nums[k]];
} else if (i - nums[k] == 0) {
dp[i] += 1;
}
}
}
return dp[target];
}