leetcode 39. Combination Sum 深搜+回溯

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

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

Note:

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

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]
Example 2:

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
[2,2,2,2],
[2,3,3],
[3,5]
]

Constraints:

1 <= candidates.length <= 30
1 <= candidates[i] <= 200
Each element of candidate is unique.
1 <= target <= 500

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> res;
        vector<int> cur;
        sort(candidates.begin(), candidates.end());
        dfs(candidates, target, res, 0, cur);
        return res;
    }
    void dfs(vector<int>& a, int t, vector<vector<int>>& r, int s, vector<int>& cur){
        if(t==0){
            r.push_back(cur);
            return ;
        }
        int n=a.size();
        for(int i=s;i<n;i++){
            if(t<a[i])break;
            cur.push_back(a[i]);
            dfs(a, t-a[i], r, i, cur);
            cur.pop_back();
        }
    }
};