Leetcode-Combination Sum（深搜）

Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited number of times.

Note:

• All numbers (including target) will be positive integers.
• The solution set must not contain duplicate combinations.

For example, given candidate set [2, 3, 6, 7] and target 7,
A solution set is:

[
  [7],
  [2, 2, 3]
]

---

class Solution
{
public:
	vector<vector<int>> ass;
	void dfs(int depth, vector<int> tmp, int target, vector<int> &candidates, int sum) {
		if (sum > target)
			return;
		if (sum == target) {
			ass.push_back(tmp);
			return;
		}
		for (int i = depth; i < candidates.size(); i++) {
			tmp.push_back(candidates[i]);
			dfs(i, tmp, target, candidates, sum + candidates[i]);
			tmp.pop_back();
		}
	}
	vector<vector<int>> combinationSum(vector<int> &candidates, int target) {
		vector<int> tmp;
		sort(candidates.begin(), candidates.end());
		dfs(0, tmp, target, candidates, 0);
		return ass;
	}
};