LeetCode Combination Sum

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]

首先写了个递归的，超时了。
然后写了动态规划，一个用map存储中间结果，耗时592ms，一个用vector，耗时388ms。

map版本

class Solution {
public:
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        map<int, vector<vector<int> > > sum2combs;
    	for(int curSum = 1; curSum <= target; ++curSum)
		{
			for(int idx = 0; idx < candidates.size(); ++idx)
			{
				if(curSum - candidates[idx] < 0)
					continue;
				if(0 == curSum - candidates[idx])
				{
					sum2combs[curSum].push_back(vector<int>());
					sum2combs[curSum].back().push_back(candidates[idx]);
					continue;
				}
				int prevSum = curSum - candidates[idx];
				if(sum2combs.find(prevSum) == sum2combs.end())
					continue;
				int size = sum2combs[prevSum].size();
				for(int i = 0; i < size; ++i)
				{
					if(sum2combs[prevSum][i].back() <= candidates[idx])
					{
						sum2combs[curSum].push_back(vector<int>(sum2combs[prevSum][i]));
						sum2combs[curSum].back().push_back(candidates[idx]);
					}
				}
			}
		}
        return sum2combs[target];
    }
};

vector版本

class Solution {
public:
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        vector<vector<vector<int> > > combs(target + 1);
		for(int cur = 1; cur <= target; ++cur)
		{
			for(int idx = 0; idx < candidates.size(); ++idx)
			{
				if(cur - candidates[idx] < 0)
					continue;
				else if(cur - candidates[idx] == 0)
				{
					combs[cur].push_back(vector<int>());
					combs[cur].back().push_back(candidates[idx]);
					continue;
				}
				else
				{
					int prevSum = cur - candidates[idx];
					for(int i = 0; i < combs[prevSum].size(); ++i)
					{
						if(combs[prevSum][i].back() <= candidates[idx])
						{
							combs[cur].push_back(vector<int>(combs[prevSum][i]));
							combs[cur].back().push_back(candidates[idx]);
						}
					}
				}
			}
		}
        return combs[target];
    }
};