[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 (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
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]

这一题一开始做错了总是output limit excess。后来发现是因为没有去掉重复的情况，导致多输出了一些元素。应该属于WA。

一开始没考虑去重的：

class Solution {
public:
    int sum(vector<int> &res){
        int cnt = 0;
        for(int i =0;i<res.size();i++) cnt+=res[i];
        return cnt;
    }

    void f(bool flag,vector<int> &candidates, int target,vector<vector<int> > & ans,vector<int> &res){
        if(flag == true) {
           ans.push_back(res);
           return;
        }
        for(int i = 0; i < candidates.size(); i++){
            if(sum(res)+candidates[i] < target){
                res.push_back(candidates[i]);
                f(false,candidates,target,ans,res);
                res.pop_back();
            }
            else if(sum(res)+candidates[i] == target){
                res.push_back(candidates[i]);
                f(true,candidates,target,ans,res);
                res.pop_back();
            }
            else{}
        }

    }

    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        sort(candidates.begin(),candidates.end());
        reverse(candidates.begin(),candidates.end());
        vector<vector<int> > ans;
        vector<int> res;
        f(false,candidates,target,ans,res);
        return ans;
    }
};

正确的：

class Solution {
public:
    void f(int index,int sum,vector<int> &candidates, int target,vector<vector<int>> &ans,vector<int> res){
        if(sum > target) return;
        if(sum == target){
         ans.push_back(res);
         return ;
        }
        for(int i = index;i < candidates.size();i++){
            res.push_back(candidates[i]);
            f(i,sum+candidates[i],candidates,target,ans,res);
            res.pop_back();
        }

    }
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> ans;
        vector<int> res;
        f(0,0,candidates,target,ans,res);
        return ans;
    }
};