leetcode---Combination Sum

Given a set of candidate numbers (C) 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.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
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>> ans;
    void dfs(vector<int>& candidates, int target, int depth, int sum, vector<int> tmp)
    {
        if(sum > target)
            return;
        if(sum == target)
        {
            ans.push_back(tmp);
            return;
        }
        for(int i=depth; i<candidates.size(); i++)
        {
            tmp.push_back(candidates[i]);
            dfs(candidates, target, i, sum+candidates[i], tmp);
            tmp.pop_back();
        }
    }

    vector<vector<int>> combinationSum(vector<int>& candidates, int target) 
    {
        vector<int> tmp;
        sort(candidates.begin(), candidates.end());
        dfs(candidates, target, 0, 0, tmp);
        return ans;
    }
};