40. Combination Sum II

清风予你

于 2016-07-17 16:54:29 发布

阅读量191

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： combinations ii leet

本文链接：https://blog.youkuaiyun.com/cwcww1314/article/details/51933107

leetcode 专栏收录该内容

72 篇文章

订阅专栏

本文介绍了一种寻找候选数集合中所有唯一组合的算法，这些组合的和等于目标数。该算法采用深度优先搜索策略，并通过排序和跳过重复元素来避免重复组合。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.
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

class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>> res;
vector<int> tmp;
sort(candidates.begin(),candidates.end());
dfs(res,tmp,candidates,target,0);
return res;

}
void dfs(vector<vector<int>> &res,vector<int> &tmp,vector<int> &candidates,int target,int pos)
{
if(target<0) return ;
if(target==0)
{
res.push_back(tmp);
return ;
}
for(int i=pos;i<candidates.size();i++)
{
tmp.push_back(candidates[i]);
dfs(res,tmp,candidates,target-candidates[i],i+1);
tmp.pop_back();
while(i<candidates.size()-1&&candidates[i+1]==candidates[i]) i++;
}

}
};: