Combination Sum问题及解法

最新推荐文章于 2022-04-18 23:10:00 发布

我们要爱学习

最新推荐文章于 2022-04-18 23:10:00 发布

阅读量461

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium Backtracking

本文链接：https://blog.csdn.net/u011809767/article/details/73106356

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

Given a set of candidate numbers (C) (without duplicates) 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.
The solution set must not contain duplicate combinations.

示例：

Given candidate set [2, 3, 6, 7] and target 7,
A solution set is:

[
  [7],
  [2, 2, 3]
]

问题分析：

本题主要是一个递归遍历寻找求和组合的过程，为了方便接下来好处理，我们先把candidate集合升序排序，依次对其中的每一个元素从左向右顺序递归遍历求和，满足最终条件的数组放入res数组集合中。

过程详见代码：

class Solution {
public:
    vector<vector<int> > combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int> > res;
		vector<int> re;
		int start = 0;
		bs(candidates,target,res,re,start);
		
		return res;        
    }
    
    void bs(vector<int>& candidates, int target, vector<vector<int> >& res, vector<int>& re,int start) {
    	
        for(int i = start; i < candidates.size(); i++)
        {
        	if(candidates[i] <= target)
        	{
        		re.push_back(candidates[i]);
	        	if(candidates[i] == target) 
				{
					res.push_back(re);
				}
	        	else bs(candidates,target - candidates[i],res,re,i);
	        	re.pop_back();
			}
			else break;
		}
    }
};