此题回朔,注意加入前避免重复
class Solution {
public:
vector<vector<int>> ret;
public:
vector<vector<int>> combinationSum2(vector<int>& can, int target) {
if(can.size()<1) return ret;
sort(can.begin(),can.end());
vector<int> temp;
if(target<can[0]) return ret;
//temp.push_back(can[0]);
bt(can,temp,target,0,target);
return ret;
}
void bt(vector<int>&can,vector<int> ans_vec,int ans,int next_pos,int target){
if(ans<0){
return;
}
if(target<=0) return ;
if(ans==0){
for(int i=0;i<ret.size();i++){
if(ret[i]==ans_vec) return; //最后在这里判断是不是和以前的数组重复了
}
ret.push_back(ans_vec);
return ;
}
for(int i=next_pos;i<can.size();i++){
if(ans>=can[i]){
vector<int> temp=ans_vec;
temp.push_back(can[i]);
bt(can,temp,ans-can[i],i+1,target);
}
}
}
};