首页>itarticle>[leetcode] problem 40 – combination sum ii
[leetcode] problem 40 – combination sum ii
admin11月 13, 20200
Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
Each number in candidates may only be used once in the combination.
Note
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example
No.1
Input: candidates = [10,1,2,7,6,1,5], target = 8, A solution set is:
public List<List<Integer>> combinationSum2(int[] candidates, int target) { List<List<Integer>> result = new ArrayList<>(); List<Integer> combination = new ArrayList<>(); Arrays.sort(candidates);
近期评论