LeetCode *** 40. Combination Sum II

最新推荐文章于 2018-12-21 16:59:11 发布

原创最新推荐文章于 2018-12-21 16:59:11 发布 · 236 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

212 篇文章

订阅专栏

本文探讨了如何在给定候选数字集合中找到所有唯一组合，这些组合的元素之和等于指定的目标数，同时每个数字只能使用一次且组合元素按非递减顺序排列，确保解决方案集中不包含重复组合。

题目：

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:
    int tg;
    vector<vector<int>> res;
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        tg=target;
        vector<int>tmp;
        dfs(candidates,tmp,0,0);
        return res;
    }
    void dfs(vector<int>& nums,vector<int> tmp,int start,int sum){
        int s,i=start;
        while(i<nums.size()){
            while(i!=start&&nums[i]==nums[i-1])i++;
            s=sum+nums[i];
            if(s==tg){
                tmp.push_back(nums[i]);
                res.push_back(tmp);
                return;
            }
            if(s<tg){
                tmp.push_back(nums[i]);
                dfs(nums,tmp,i+1,s);
                tmp.pop_back();
            }
            i++;
        }
    }
};