int main(int argc, char** argv) { int D[] = {1}; int dTarget = 1; vector<int> Dv; for (int i = 0; i< sizeof(D)/sizeof(int); ++i) Dv.push_back(D[i]); Solution s; results = s.combinationSum(Dv, dTarget); PrintVV(results); int A[] = {4,2,7,5,6}; int aTarget = 16; vector<int> Av; for (int i = 0; i< sizeof(A)/sizeof(int); ++i) Av.push_back(A[i]); results = s.combinationSum(Av, aTarget); PrintVV(results); //Second test stub int B[] = { 28,22,43,41,21,29,27,38,47,23,20,49,24,31,37,26,32,36,25,33,40,46,30,44,35 }; int bTarget = 74; vector<int> Bv; for (int i = 0; i< sizeof(B)/sizeof(int); ++i) Bv.push_back(B[i]); //sort(Bv.begin(), Bv.end()); results = s.combinationSum(Bv, bTarget); PrintVV(results); int C[] = {71,79,97,107,81,87,70,102,92,95,80,83,84,91,119,111,89,86,108,98,104,88,82,116,73,74,90,117,85,75,93,99,100,112,78,72,114,96}; int cTarget = 362; vector<int> Cv; for (int i = 0; i< sizeof(C)/sizeof(int); ++i) Cv.push_back(C[i]); s.combinationSum(Cv, cTarget); PrintVV(results); return 0; }
int _tmain(int argc, _TCHAR* argv[]) { vector<int> candidate = { 2, 3, 5 }; Solution solution; solution.combinationSum(candidate, 7); return 0; }
int main(int argc, char **argv) { vector<int> candidates; int input; int target; while(cin >> input && input != -1) { candidates.push_back(input); } cin >> target; Solution 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; }
int main() { vector<int> candidates; candidates.push_back(2); candidates.push_back(3); candidates.push_back(6); candidates.push_back(7); int target = 7; Solution 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; } system("pause"); return 0; }
int main() { vector<int> input; input.clear(); input.push_back( 2 ); input.push_back( 2 ); input.push_back( 3 ); input.push_back( 3 ); input.push_back( 6 ); input.push_back( 7 ); Solution s; vector<vector<int> >result = s.combinationSum( input, 7 ); for( unsigned int i = 0; i < result.size(); i++ ) { cout << endl; for( unsigned int j = 0; j < result[i].size(); j++ ) { cout << result[i][j]; } cout << endl; } return 0; }
int main() { Solution solution; int a[] = {2,3,6,7}; vector<int> p(a,a+4); int p1; vector< vector<int> > p2; p1 = 7; p2 = solution.combinationSum(p,p1); vector< vector<int> >::iterator iter; vector<int>::iterator iter1; for(iter = p2.begin(); iter != p2.end(); iter++) { for(iter1 = (*iter).begin(); iter1 != (*iter).end(); iter1++) { cout<<*iter1<<" "; } cout<<endl; } return 0; }
int main() { Solution S; int a[]={1,2,3}; vector<int> vec(a,a+3); S.combinationSum(vec,5); }
int main(int argc, const char *argv[]) { int a[] = {2,3,6,7}; vector<int> b(a, a+sizeof(a)/sizeof(int)); Solution sol; cout << sol.combinationSum(b, 7) << endl; return 0; }
int main() { Solution s; int cands[] = {1,2,3,1}; vector<int> candidates(cands, cands + sizeof(cands) / sizeof(int)); vector<vector<int> > res = s.combinationSum(candidates, 4); print(res); return 0; }
int main() { Solution a; auto b = vector<int> ({2, 3}); auto biu = a.combinationSum(b, 100); for(auto i: biu) { for(auto j: i) { cout << j << ' '; } cout << endl; } }
int main() { Solution sol; int target = 7; // vector<int> candidates = {2,3,6,7}; vector<int> candidates = {1, 2, 3, 4, 5, 6, 7}; auto result = sol.combinationSum(candidates, target); print_2D<int>(result); return 0; }
int main() { vector<int> vec = { 1,2,3,4,5}; int tar = 7; Solution s; vector<vector<int>> result = s.combinationSum(vec, tar); printvec(result); system("pause"); return 0; }
int main() { #define N 4 int tmp[] = {2,3,6,7}; vector<int> input(tmp, tmp+N); Solution sol; vector<vector<int> > res = sol.combinationSum(input, 7); print2DVecotr(res); return 0; }
int main() { Solution s; vector<int> candidates({8, 7, 4, 3}); vector<vector<int> > v = s.combinationSum(candidates, 11); for (auto i : v) { for (auto j : i) { cout<<j<<" "; } cout<<endl; } }
int main() { Solution s; vector<int> candidate; candidate.push_back(2); candidate.push_back(3); candidate.push_back(6); candidate.push_back(7); dump(s.combinationSum(candidate, 12)); return 0; }
int main(){ Solution s; vector<int> num{2,3,6,7}; auto res = s.combinationSum(num, 7); for(auto vec : res){ for(auto x : vec) cout << x << '\t'; cout << endl; } return 0; }
int main(){ Solution s; int a[7] = {1,2}; vector<int> candidates(a,a+2); vector< vector<int> > res = s.combinationSum(candidates,4); for(int i=0;i<res.size();i++){ for(int j=0;j<res[i].size();j++) cout<<res[i][j]<<" "; cout<<endl; } }
int main() { Solution s; vector<int> canditates; canditates.push_back(2); canditates.push_back(3); canditates.push_back(4); canditates.push_back(7); s.combinationSum(canditates,7); return 0; }
int main() { vector<int> candidates; candidates.push_back(2); candidates.push_back(3); candidates.push_back(6); candidates.push_back(7); Solution sol; vector<vector<int>> ans = sol.combinationSum(candidates, 7); return 0; }
int main(){ Solution st; vector<int> C(4); C[0] = 2, C[1] = 3, C[2] = 6, C[3] = 7; vector<vector<int> > vvi = st.combinationSum(C, 7); for(int i = 0; i < vvi.size(); ++i){ for(int j = 0; j < vvi[i].size(); ++j) cout<<vvi[i][j]<<' '; cout<<endl; } return 0; }
int main() { Solution c; vector<int> x = {10,1,2,7,6,1,5}; vector<vector<int>> y = c.combinationSum(x,8); for(int i = 0; i< y.size(); i++) { for(auto j: y[i]) cout<<j<<" "; cout<<endl; } }
int main() { Solution s; int A[] = {2,3,6,7}; vector<int> v(A, A+4); vector< vector<int> > ret = s.combinationSum(v, 7); for (int i = 0; i < ret.size(); i++) { for (int j = 0; j < ret[i].size(); j++) printf("%d ", ret[i][j]); puts(""); } return 0; }
int main() { Solution solution; //Test cases { int a[] = {2, 3, 6, 7}; vector<int> v; INT_ARR_TO_VEC(v, a); int target = 7; print_vector_vector(solution.combinationSum(v, target)); } { int a[] = {2, 3, 6, 7}; vector<int> v; INT_ARR_TO_VEC(v, a); int target = 0; print_vector_vector(solution.combinationSum(v, target)); } { int a[] = {2, 3, 6, 7}; vector<int> v; INT_ARR_TO_VEC(v, a); int target = 20; print_vector_vector(solution.combinationSum(v, target)); } //Error test cases from leetcode.com return 0; }
int main() { int A[] = {2, 3, 6, 7}; vector<int> candidates(A, A+sizeof(A)/sizeof(int)); int target = 7; Solution solu = Solution(); vector<vector<int> > res = solu.combinationSum(candidates, target); for (size_t i = 0; i < res.size(); i++) { for (size_t j = 0; j < res[i].size(); j++) { cout << res[i][j] << ", "; } cout << endl; } }
int main(void) { Solution mysolution; int in[]={2,3,6,7}; int i; vector<int> input(in,in+4); vector<vector<int> > output; output= mysolution.combinationSum(input,7); for (i=0;i<output.size();i++) PrintVector(output[i]); }
void TEST() { vector<int> candidates{ 2,3,6,7 }; Solution sol; vector<vector<int>> ret = sol.combinationSum(candidates, 7); for (auto v : ret) { for (auto i : v) cout << i << " "; cout << endl; } }
int _tmain(int argc, _TCHAR* argv[]) { vector<int> candidates; candidates.push_back(2); candidates.push_back(7); candidates.push_back(2); candidates.push_back(6); candidates.push_back(3); Solution so; vector<vector<int> > result = so.combinationSum(candidates, 7); return 0; }
int main() { Solution a; vector<int> candidates = {10,1,2,7,6,1,5}; vector<vector<int> > sol(a.combinationSum(candidates, 8)); // vector<int> candidates = {1,1}; // vector<vector<int> > sol(a.combinationSum(candidates, 2)); for (auto v : sol) { for (int n : v) { std::cout << n << ", "; } std::cout << std::endl; } }
int main() { vector <int> v; v.push_back(2), v.push_back(3); v.push_back(6), v.push_back(7); Solution solution = Solution(); vector <vector <int> > result = solution.combinationSum(v, 7); for (int i = 0; i < SZ(result); ++ i) { for (int j = 0; j < SZ(result[i]); ++ j) { cout << result[i][j] << " "; } cout << endl; } return 0; }
int main(int argc, char const *argv[]) { vector<int> candidates ={1,1,1,2,2}; Solution sl; vector<vector<int> > res; res = sl.combinationSum(candidates,4); for (int i = 0; i < res.size(); ++i) { for(int j = 0; j < res[i].size(); ++j) cout<<res[i][j]<<" -|- "; cout<<"\n~~~~~~~~~"<<endl; } return 0; }