leetcode/CombinationSumII.cpp at master · jiangshen95/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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include<iostream>
#include<vector>

using namespace std;

class Solution {
public:
    vector<vector<int> > combinationSum2(vector<int>& candidates, int target) {

        vector<vector<int> > result;
        vector<int> one;

        vector_qsort(candidates,0,candidates.size()-1);

        combinationSum2(result,one,candidates,target,0);

        return result;

    }

    void vector_qsort(vector<int>& nums,int l,int r){
    	if(l<r){
    		int i=l,j=r;
    		int v=nums[l];
    		while(i<j){
    			while(i<j&&nums[j]>=v) j--;
    			nums[i]=nums[j];
    			while(i<j&&nums[i]<=v) i++;
    			nums[j]=nums[i];
			}
			nums[i]=v;
			vector_qsort(nums,l,i);
			vector_qsort(nums,i+1,r);
		}
	}

    void combinationSum2(vector<vector<int> >& result, vector<int>& one, vector<int>& candidates, int target, int l){
    	for(int i=l;i<candidates.size();i++){
    		if(i>l&&candidates[i]==candidates[i-1]){
    			continue;
			}

    		if(target>candidates[i]){
    			one.push_back(candidates[i]);
    			combinationSum2(result,one,candidates,target-candidates[i],i+1);
			}
			else if(target==candidates[i]){

				one.push_back(candidates[i]);
				result.push_back(one);
				one.pop_back();

				break;

			}
			else{
				break;
			}
		}
		if(!one.empty()){
			one.pop_back();
		}

	}
};

int main(){
	int n;
	cin>>n;

	vector<int> candidates;
	for(int i=0;i<n;i++){
		int num;
		cin>>num;
		candidates.push_back(num);
	}

	int target;
	cin>>target;

	Solution *solution=new Solution();
	vector<vector<int> > result=solution->combinationSum2(candidates,target);
	for(int i=0;i<result.size();i++){
		for(int j=0;j<result[i].size();j++){
			cout<<result[i][j]<<", ";
		}
		cout<<endl;
	}

	return 0;
}