一:题目
二:上码
class Solution {
private List<List<Integer>> ans = new ArrayList<>();
private List<Integer> path = new ArrayList<>();
public int getSum(List<Integer> list) {
int sum = 0;
for (Integer nums : list) sum += nums;
return sum;
}
public void getAns(int st,int[] candidates,int target) {
if (getSum(path) >= target) {
if (getSum(path) == target) ans.add(new ArrayList<>(path));
return;
}
for (int i = st; i < candidates.length; i++) {
if (i - 1 >= st && candidates[i] == candidates[i-1]) continue;
path.add(candidates[i]);
getAns(i+1,candidates,target);
path.remove(path.size()-1);
}
}
public List<List<Integer>> combinationSum2(int[] candidates, int target) {
Arrays.sort(candidates);
getAns(0,candidates,target);
return ans;
}
}