leetcode - 39. Combination Sum

朴素的回溯法

class Solution {
public:
    void findd(vector<vector<int>> & ret,vector<int> & num,vector<int> & can,int t,int n,int i)
    {
        if(n==t)
        {
            ret.push_back(num);
        }else if(n<t)
        {
            for(;i<can.size()&&(n+can[i])<=t;++i)
            {
                num.push_back(can[i]);
                findd(ret,num,can,t,n+can[i],i);
                num.pop_back();
            }
        }
        return ;
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int>>ret;
        vector<int> num;
        int x(0),i(0);
        findd(ret,num,candidates,target,0,0);
        return ret;
    }
};