Middle-题目79:40. Combination Sum II

原创 2016年05月31日 16:58:45

题目原文:
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]
题目大意:
Middle-题目54的基础上,现在允许重复数字出现,但每个重复数字只能用一次,还是求所有的排列情况。
题目分析:
Middle-题目54的基础上修改,还是先排序,相同的元素分别统计,然后去重的思路与Middle-题目76相同。
源码:(language:java)

public class Solution {
    public  List<List<Integer>> combinationSum2(int[] candidates, int target) {
        Arrays.sort(candidates);
        List<List<Integer>> list = new ArrayList<List<Integer>>();
        backtrack(list, new ArrayList<Integer>(), candidates, target, 0);
        return list;
    }
    private  void backtrack(List<List<Integer>> list, List<Integer> sublist, int[] candidates, int target, int startPos) {
        if(target == 0) {
            list.add(new ArrayList<Integer>(sublist));
            return;
        }
        else {
            for(int i = startPos; i < candidates.length; i++) {
                int temp = candidates[i];
                if(temp <= target) {
                    int iCount = 1;
                    while(i+1!=candidates.length&&candidates[i]==candidates[i+1]) {
                        iCount++;
                        i++;
                    }
                    for(int j = 1;j<=iCount;j++) {
                        for(int k = 0;k<j;k++)
                            sublist.add(temp);
                        backtrack(list,sublist,candidates,target-temp*j,i+1);
                        for(int k = 0;k<j;k++)
                            sublist.remove(sublist.size()-1);
                    }
                }
            }
        }
    }
}

成绩:
9ms,beats 62.50%,众数5ms,18.18%

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

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
  • 523

LeetCode40 Combination Sum II 解析

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

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

LeetCode_OJ【40】Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in...
  • hb_peng
  • hb_peng
  • 2016年01月12日 20:51
  • 249

DAY19:leetcode #40 Combination Sum II

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

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