class Solution {

    List<List<Integer>> ans = new ArrayList<>();

    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        Arrays.sort(candidates);
        solve(new ArrayList<>(), candidates, 0, target);
        return ans;
    }

    void solve(List<Integer> curr, int[] cand, int idx, int target) {
        if (target == 0) {
            ans.add(new ArrayList<>(curr));
            return;
        }
        for (int i = idx; i < cand.length; i++) {
            if (target < cand[i])
                break;
            if (i > idx && cand[i] == cand[i - 1])
                continue;
            curr.add(cand[i]);
            solve(curr, cand, i + 1, target - cand[i]);
            curr.remove(curr.size() - 1);
        }
    }
}