letcode 39

超级垃圾的递归突破一

切记切记！！！

#include<iostream>  
#include <vector>
#include <algorithm>
#include <string>
using namespace std;


vector<vector<int>> res;
void subfunc(vector<int>& candidates, int target, int pos, vector<int>& tmp)
{
if (target<0)//原本这里写的是<candidates[pos]，错误！！！递归调用subfunc的时候已经减去了一次candidates[pos]了，所以这里跟0比较，不要非得跟candidates[pos]比作死了
return;
if (target == 0)//原本这里写的是==candidates[pos]
{
//tmp.push_back(candidates[pos]);
res.push_back(tmp);
//tmp.pop_back();
return;
}
for (int i = pos; i<candidates.size(); i++)
{
tmp.push_back(candidates[i]);
subfunc(candidates, target - candidates[i], i, tmp);
tmp.pop_back();
}
}
int main()
{
vector<int> candidates(4);
candidates[0] = 2;
candidates[1] = 3;
candidates[2] = 6;
candidates[3] = 7;
int target=7;

sort(candidates.begin(), candidates.end());

vector<int> tmp;
subfunc(candidates, target, 0, tmp);
for (int i = 0; i < res.size(); i++)
{
for (int j = 0; j < res[i].size(); j++)
{
if (j == res[i].size() - 1)
cout << res[i][j] << endl;
else
cout << res[i][j];

}
}
system("pause");
return 0;
}