LeetCode40:Combination Sum II

原创 2015年07月06日 21:17:58

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]

这道题和前面Combination Sum 很像,只是判断条件不同而已,题目的难度也没有增加,使用相同的思路即可求解。需要注意的有一点:
对于[1 ,1 ,2] ,3这种输入,需要剔除挑重复元素,所以在递归函数中需要剔除重复元素。

runtime:16ms

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<int> path;
        vector<vector<int>> result;
        helper(candidates,0,0,target,path,result);
        return result;
    }

    void helper(vector<int> &nums,int pos,int base,int target,vector<int> &path,vector<vector<int>> &result)
    {
        if(base==target)
        {
            result.push_back(path);
            return;
        }
        if(base>target)
            return;

        for(int i=pos;i<nums.size();i++)
        {
            path.push_back(nums[i]);
            helper(nums,i+1,base+nums[i],target,path,result);
            path.pop_back();
            while(nums[i]==nums[i+1]) i++; //这一步需要将重复的i剔除掉,做关于递归的题目时假设上面的代码正确执行,消除重复在这一步做即可。
        }
    }
};

相关文章推荐

40. Combination Sum II(重要)

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in...

40. Combination Sum II

此题是Combination Sum的扩展,但是每个元素最多只能选用一次。由于有重复元素的存在,比如数组为[1(1),1(2),2,3],target = 6,可能出现重复结果1(1),2,3 和 1...

LeetCode_40---Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations ...

Leetcode #40. Combination Sum II 组合求和2 解题报告

1 解题思想这道题是昨天的升级版,先看看这个 Leetcode #39. Combination Sum 组合求和 解题报告这道题的改变就是每个位置的数只能用一次了,但是如果本身就给了多个的话就无...
  • MebiuW
  • MebiuW
  • 2016年04月11日 23:57
  • 502

LeetCode40 Combination Sum II 解析

详细见:leetcode.com/problems/combination-sum-ii C和Python的去重算法,应该记住。 Java是很久之前写的,并不好。 规则是:相同数字。 ...
  • zxwtry
  • zxwtry
  • 2017年04月06日 22:20
  • 121

[LeetCode-Java]40. Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in...

Leetcode 40. Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in...

[leetcode] 39& 40 Combination Sum I& II

if (i != index && num[i] == num[i - 1]) continue; Given a set of candidate numbers (C) and a target...

LeetCode(40) Combination Sum II

题目如下: My Submissions Question Solution  Given a collection of candidate numbers (C) and a target num...

LeetCode OJ-40-Combination Sum II

题目: Given a collection of candidate numbers (C) and a target number (T), find all unique combinatio...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode40:Combination Sum II
举报原因:
原因补充:

(最多只允许输入30个字)