Permutations II

    //space maybe use a lot
    public ArrayList<ArrayList<Integer>> permuteUnique(int[] num) {
        // Start typing your Java solution below
        // DO NOT write main() function
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();  
        if(num.length == 0) return result;  
        ArrayList<Integer> first = new ArrayList<Integer>();  
        first.add(num[0]);  
        result.add(first); 
        Set<ArrayList<Integer>> set = new HashSet<ArrayList<Integer>>();
        set.add(first);
        for(int i = 1; i < num.length; i++) {  
            int size = result.size();  
            ArrayList<ArrayList<Integer>> tmp = new ArrayList<ArrayList<Integer>>();  
            for(int j = 0; j < size; j++) {  
                for(int k = 0; k <= i; k++){  
                    ArrayList<Integer> sub = new ArrayList<Integer>();  
                    sub.addAll(result.get(j));  
                    sub.add(k, num[i]);
                    if(!set.contains(sub)) {
                        tmp.add(sub); 
                        set.add(sub);
                    }
                }  
            }  
            result = tmp;  
        }  
        return result;     
    }