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?
Credits:
Special thanks to @pbrother for adding this problem and creating all test cases.
题目链接:https://leetcode-cn.com/problems/combination-sum-iv/
思路
DP。
和找零钱的题目方法一样,只不过找零钱记录的是零钱数量,这道题记录的是组合数量。
!注意这题会有int溢出的问题,long long也不行,需要用unsigned long long。
typedef unsigned long long ull;
class Solution {
public:
int combinationSum4(vector<int>& nums, int target) {
int len = nums.size();
if(len==0 || target<=0) return 0;
ull rec[target+1] = {1};
for(int i=1; i<=target; ++i){
for(int j=0; j<len; ++j){
if(nums[j]>i) continue;
rec[i] += rec[i-nums[j]];
}
}
return rec[target];
}
};
系列题有很多,先不总结了,之后慢慢做。