标签：inline turn ret nat highlight data- alert duplicate cpp
Given an integer array nums with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.
A number in the array can be used multiple times in the combination.
Different orders are counted as different combinations.
Example1
Input: nums = [1, 2, 4], and target = 4
Output: 6
Explanation:
The possible combination ways are:
[1, 1, 1, 1]
[1, 1, 2]
[1, 2, 1]
[2, 1, 1]
[2, 2]
[4]
Example2
Input: nums = [1, 2], and target = 4
Output: 5
Explanation:
The possible combination ways are:
[1, 1, 1, 1]
[1, 1, 2]
[1, 2, 1]
[2, 1, 1]
[2, 2]
class Solution {
public:
int combinationSum4(vector<int>& nums, int target) {
int n = nums.size();
int f[target+1];
memset(f, 0, sizeof(f));
f[0] = 1;
for (int i = 1; i <= target; i++) {
for (int j = 0; j < n; j++)
if (i - nums[j] >= 0){
f[i] += f[i-nums[j]];
}
}
return f[target];
}
};
标签：inline turn ret nat highlight data- alert duplicate cpp
原文地址：https://www.cnblogs.com/FLAGyuri/p/12078408.html
