题目
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2,7,6,1,5 and target 8,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]
算法
DFS
复杂度
O(n!)
#include<iostream>
#include<vector>
#include <algorithm>
using namespace std;
class Solution{
private:
void dfs(vector<vector<int> > &ans,vector<int> &single,vector<int> &candi,int cur,int rest){
int sz=candi.size();
if(rest==0){
//to avoid [[1,1,1],2]
if(!single.empty() && cur<sz && single[single.size()-1]==candi[cur])
return;
ans.push_back(single);
return;
}
if(sz<=cur || rest<0)
return;
//choose cyr
single.push_back(candi[cur]);
dfs(ans,single,candi,cur+1,rest-candi[cur]);
single.pop_back();
//donot choose cur
//donot contain duplicate combinations
if(!single.empty() && single[single.size()-1]==candi[cur])
return;
dfs(ans,single,candi,cur+1,rest);
}
public:
vector<vector<int> > combinationSum2(vector<int> &nums,int target){
vector<vector<int> > ans;
vector<int> single;
sort(nums.begin(),nums.end());
dfs(ans,single,nums,0,target);
return ans;
}
};