关闭

Middle-题目79:40. Combination Sum II

76人阅读 评论(0) 收藏 举报
分类:

题目原文:
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%

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:55987次
    • 积分:3198
    • 等级:
    • 排名:第10679名
    • 原创:270篇
    • 转载:53篇
    • 译文:0篇
    • 评论:7条
    文章分类
    最新评论