Leetcode/leetcode39.cpp at main · ksaini-web/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
class Solution {
public:
set<vector<int>>s;
//helper fuction

void getallcombination(vector<int>& candidates,int idx,int target,    vector<vector<int>>&ans,vector<int>combin){

    if(idx==candidates.size() || target<0){
        return ;
    }
    if(target==0){
        if(s.find(combin)==s.end()){
        ans.push_back(combin);
        s.insert(combin);
        }
        return;
    }

   combin.push_back(candidates[idx]);
   //single
   getallcombination(candidates,idx,target-candidates[idx],ans,combin);
   //multiple
     getallcombination(candidates,idx,target-candidates[idx],ans,combin);
combin.pop_back();
 getallcombination(candidates,idx+1,target,ans,combin);


}


    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {

    vector<vector<int>>ans;
    vector<int>combin;
     getallcombination(candidates,0,target,ans,combin);

     return ans;
    }
};