Combination Sum

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations incandidates 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.
• class Solution {
  public:
      vector<vector<int>> combinationSum(vector<int>& candidates, int target) 
      {
          vector<vector<int>> ret;
          vector<int> out;
          sort(candidates.begin(),candidates.end());
          findAll(candidates,target,0,out,ret);
          return ret;
      }
      void findAll(vector<int>&candidates,int target,int start,vector<int>& out,vector<vector<int>>& ret)
      {
          if(target<0)
              return;
          else if(target==0)
              ret.push_back(out);
          else
          {
              for(int i=start;i<candidates.size();i++)
              {
                  out.push_back(candidates[i]);
                  findAll(candidates,target-candidates[i],i,out,ret);
                  out.pop_back();
              }
          }
      }
  };