39. Combination Sum

题目思路分析：

使用深度优先的方法搜索，并且用一个vector记录向量，找到合适的向量时即将它保存在结果中，并进行回溯操作.

class Solution {
public:
    vector<vector<int> >result;
    vector<int>temp;
    vector<vector<int> > combinationSum(vector<int>& candidates, int target) 
    {
        if(candidates.empty())
            return result;
        helper(0,candidates,target);
        return result;
    }
    void helper(int start,vector<int>& candidates,int target)
    {
        if(target<0)
            return;
        else if(0==target)
        {
            result.push_back(temp);
            return;
        }
        else
        {
            int i;
            for(i=start;i<candidates.size();i++)
            {
                temp.push_back(candidates[i]);
                helper(i,candidates,target-candidates[i]);
                temp.pop_back();
            }
        }
    }
};

class Solution {
public:
    vector<vector<int> > combinationSum(vector<int>& candidates, int target) 
    {
        vector<vector<int> >result;
        vector<int>temp;
        if(candidates.empty())
            return result;
        helper(0,candidates,target,result,temp);
        return result;
    }
    void helper(int start,vector<int>& candidates,int target,vector<vector<int> >&result,vector<int>&temp)
    {
        if(target<0)
            return;
        else if(0==target)
        {
            result.push_back(temp);
            return;
        }
        else
        {
            int i;
            for(i=start;i<candidates.size();i++)
            {
                temp.push_back(candidates[i]);
                helper(i,candidates,target-candidates[i],result,temp);
                temp.pop_back();
            }
        }
    }
};