Permutations II

public class Solution {
    public ArrayList<ArrayList<Integer>> permuteUnique(int[] num) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int len = num.length;
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        HashSet<ArrayList<Integer>> tmpResult = new HashSet<ArrayList<Integer>>();
        permutation(num, 0, len, result, tmpResult);
        return result;
    }
    
    public void permutation(int[] num, int depth, int len, ArrayList<ArrayList<Integer>> result, HashSet<ArrayList<Integer>> tmpResult){
        
        if(depth == len){
            ArrayList<Integer> per = new ArrayList<Integer>();
            for(int i =0 ; i < len; i++)
                per.add(num[i]);
                
            if(tmpResult.add(per))
                result.add(per);
        }
        
        for(int i = depth; i < len; i++) {
            if(i != depth && num[i] == num[depth])
                continue;

            int tmp = num[i];
            num[i] = num[depth];
            num[depth] = tmp;
            
            permutation(num, depth + 1, len, result, tmpResult);
            
            tmp = num[i];
            num[i] = num[depth];
            num[depth] = tmp;
        }
    }
}