class Solution {
public:
int combinationSum4(vector<int>& nums, int target) {
vector<int> temp;
vector<vector<int>>results;
combination(nums, target,temp,results);
return results.size();
}
void combination(vector<int>& nums, int target,vector<int>& temp,vector<vector<int>>& results){
if(target==0){
results.push_back(temp);
return;
}
for(int i=0;i<nums.size();i++){
if(target<0) return;
temp.push_back(nums[i]);
combination(nums,target-nums[i],temp,results);
temp.pop_back();
}
}
public:
int combinationSum4(vector<int>& nums, int target) {
vector<int> temp;
vector<vector<int>>results;
combination(nums, target,temp,results);
return results.size();
}
void combination(vector<int>& nums, int target,vector<int>& temp,vector<vector<int>>& results){
if(target==0){
results.push_back(temp);
return;
}
for(int i=0;i<nums.size();i++){
if(target<0) return;
temp.push_back(nums[i]);
combination(nums,target-nums[i],temp,results);
temp.pop_back();
}
}
};
此方法结果是对的,但是Memory Limit Exceeded,结果打开related topics发现是用dp做的。
class Solution {
public:
int combinationSum4(vector<int>& nums, int target) {
vector<int> dp(target + 1);
dp[0] = 1;
sort(nums.begin(), nums.end());
for (int i = 1; i <= target; ++i) {
for (auto a : nums) {
if (i < a) break;
dp[i] += dp[i - a];
}
}
return dp.back();
}
};
dp还不是太熟悉,先放上解题答案,以后再回顾此题。