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 (a₁, a₂, � , a_k) must be in non-descending order. (ie, a₁ ? a₂ ? � ? a_k).
• 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 {
    void foo(int *candidates, int remainNum, int remainTarget, vector<int> &curVector, vector<vector<int>> &retVector)
    {
        if (remainNum == 0)
            return;
            
        if (remainTarget == 0)
        {
            retVector.push_back(curVector);
            return;
        }
        else if (remainTarget < 0)
        {
            return;
        }
        
        for (int i=0; i<remainNum; i++)
        {
            curVector.push_back(candidates[i]);
            foo(&candidates[i], remainNum-i, remainTarget-candidates[i], curVector, retVector);
            curVector.pop_back();
        }
    }
public:
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        vector<vector<int>> retVector;
        vector<int> curVector;
        
        if (candidates.size() == 0)
            return retVector;
            
        sort(candidates.begin(), candidates.end());
        int remainNum = candidates.size();
        
        
        for (int i=0; i<remainNum; i++)
        {
            curVector.push_back(candidates[i]);
            foo(&candidates[i], remainNum-i, target-candidates[i], curVector, retVector);
            curVector.pop_back();
        }
        
        return retVector;
    }
};