Combination Sum II

public class Solution {
    public ArrayList<ArrayList<Integer>> combinationSum2(int[] num, int target) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        HashSet<ArrayList<Integer>> result = new HashSet<ArrayList<Integer>>();
        ArrayList<ArrayList<Integer>> finalresult = new ArrayList<ArrayList<Integer>>();
        ArrayList<Integer> output = new ArrayList<Integer>();
        int sum = 0;
        int len = num.length, depth = 0;
        if(len == 0){
            return finalresult;
        }
        Arrays.sort(num);
        generate(result, output, sum, depth, len, target, num);
        finalresult.addAll(result);
        return finalresult;
    }

    public void generate(HashSet<ArrayList<Integer>> result, ArrayList<Integer> output, int sum,
            int depth, int len, int target, int[] candidates){
            if(sum > target){
                return;
            }
            if(sum == target){
                ArrayList<Integer> tmp = new ArrayList<Integer>();
                tmp.addAll(output);
                result.add(tmp);
                return;
            }
            
            for(int i = depth; i < len; i++){
                sum += candidates[i];
                output.add(candidates[i]);
                generate(result, output, sum, i+1, len, target, candidates);
                sum -= output.get(output.size() - 1);
                output.remove(output.size() - 1);
            }
        }
}