LeetCode Combination Sum II

最新推荐文章于 2022-02-25 21:57:21 发布

maqingli87

最新推荐文章于 2022-02-25 21:57:21 发布

阅读量410

点赞数

分类专栏： leetcode 文章标签： numbers combinations class ie c

本文链接：https://blog.csdn.net/maqingli87/article/details/7978723

版权

leetcode 专栏收录该内容

100 篇文章 0 订阅

订阅专栏

Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

Each number in C may only be used once in the combination.

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 10,1,2,7,6,1,5 and target 8,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]

这类题看来是真会了。下面应该多练练，找一些剪枝的技巧。

class Solution {
public:
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
		vector<vector<int> > ret;
		if(0 == num.size())		
			return ret;
		sort(num.begin(), num.end());
		vector<int> digits;
		digits.push_back(num[0]);
		vector<int> counts;
		counts.push_back(1);

		for(int i = 1; i < num.size(); ++i)
		{
			if(digits.back() == num[i])
			{
				++counts.back();		
			}
			else
			{
				digits.push_back(num[i]);
				counts.push_back(1);
			}
		}
		
		vector<int> result(digits.size());
		getAll(digits, counts, result, ret, 0, 0, target);
        return ret;
    }

	void getAll(vector<int>& digits, vector<int>& counts, vector<int>& result, vector<vector<int> >& ret, int curSum, int curIdx, int target)
	{
		if(curSum == target)
		{
			ret.push_back(vector<int>());
			for(int i = 0; i < curIdx; ++i)
			{
				for(int j = 0; j < result[i]; ++j)
				{
					ret.back().push_back(digits[i]);
				}
			}
			return ;
		}
		else if(curSum > target || curIdx == digits.size())
		{
			return ;
		}
		else
		{
			for(int i = 0; i <= counts[curIdx]; ++i)
			{
				result[curIdx] = i;
				getAll(digits, counts, result, ret, curSum + i*digits[curIdx], curIdx + 1, target);
			}
		}
	}
};