leetcode/CombinationSum2.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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
#include<iostream>
#include<vector>

using namespace std;

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

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

        vector<int> index;

        //for(int i=0;i<candidates.size();i++){
        	int sum=target;
        	for(int j=0;j<candidates.size();j++){
        		if(sum>candidates.at(j)){
        			one.push_back(candidates[j]);
        			index.push_back(j);
        			sum-=candidates.at(j);
        			j--;

        			cout<<"----<-----"<<endl;
        			for(int x=0;x<one.size();x++){
        				cout<<one.at(x)<<", ";
					}
					cout<<endl;
				}
				else if(sum==candidates.at(j)){
					one.push_back(candidates[j]);
					result.push_back(one);

					cout<<"-----==-----"<<endl;
					for(int x=0;x<one.size();x++){
        				cout<<one.at(x)<<", ";
					}
					cout<<endl;

					one.pop_back();


						while(index.size()>0&&j==candidates.size()-1){
							sum+=one.back();
							one.pop_back();
							cout<<"j: "<<j<<endl;
							j=index.back();
							cout<<"j: "<<j<<endl;
							index.pop_back();
						}

				}
				else{

					cout<<"------>------"<<endl;
					for(int x=0;x<one.size();x++){
        				cout<<one.at(x)<<", ";
					}
					cout<<endl;
					cout<<"j: "<<j<<endl;

					while(j==candidates.size()-1&&index.size()>0){
						sum+=one.back();
						one.pop_back();
						j=index.back();
						cout<<"j: "<<j<<endl;
						index.pop_back();
					}

				}
			}
			//one.clear();

		//}

        return result;

    }

};

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->combinationSum(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;
}