40. Combination Sum II

最新推荐文章于 2020-02-12 03:09:08 发布

weixin_30955617

最新推荐文章于 2020-02-12 03:09:08 发布

阅读量46

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/pk28/p/5355741.html

本文解决了一个经典的算法问题：给定一组候选数和目标数，找出所有可能的组合，使得组合中候选数之和等于目标数。每个候选数只能使用一次，并且组合必须按非递减顺序排列。

摘要生成于 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.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
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]

也是比较经典的问题。然后就是注意同一个a[i]只能用1次。

class Solution {
public:
    void dfs(vector<int>& a,vector<vector<int> >&v,vector<int>&tmp,int x,int sum,int target){
        if(sum>target)return ;
        if(sum==target){
            v.push_back(tmp);
            return ;
        }
        for(int i=x;i<a.size();i++){
            if(sum+a[i]>target)break;
            if(i>x&&a[i]==a[i-1])continue;
            tmp.push_back(a[i]);
            dfs(a,v,tmp,i+1,sum+a[i],target);
            tmp.pop_back();
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int> >v;
        vector<int>tmp;
        dfs(candidates,v,tmp,0,0,target);
        return v;
    }
};