40. Combination Sum II

最新推荐文章于 2020-01-16 23:36:27 发布

sxj731533730

最新推荐文章于 2020-01-16 23:36:27 发布

阅读量271

点赞数

分类专栏： LeetCode基础知识

本文链接：https://blog.csdn.net/sxj731533730/article/details/85200743

版权

LeetCode基础知识专栏收录该内容

68 篇文章 0 订阅

订阅专栏

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

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

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

Example 1:

Input: candidates = [10,1,2,7,6,1,5] target = 8A solution set is:
[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

Example 2:

Input: candidates = [2,5,2,1,2], target = 5,
A solution set is:
[
  [1,2,2],
  [5]
]

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> vec;
        vector<int> v;
        sort(candidates.begin(),candidates.end());
        fun(0,candidates,v,vec,target);
        return vec;
   
    }
    void fun(int begin,vector<int>& candidates,vector<int>& v,vector<vector<int>> &vec,int target)
{
	if(target==0) {
        vec.push_back(v);
   }
	else {
        int pre=0;
		for(int i=begin;i!=candidates.size();i++)
            
			if(target>=candidates[i]&&candidates[i] != pre)
			{
                  
				v.push_back(candidates[i]);
				fun(i+1,candidates,v,vec,target-candidates[i]);
				pre=v.back();
                v.pop_back();
                   
			}
				
	}

 
}
};