class Solution {

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

    int vis[] = null;

    public List<List<Integer>> permuteUnique(int[] nums) {

        vis = new int[nums.length];

        Arrays.fill(vis,0);

        dfs(nums,0,new ArrayList<Integer>());

        return ans;

    }

    public void dfs(int nums[],int position,ArrayList<Integer> tmp){

        if(position>nums.length-1){

            if(tmp.size()==nums.length && ans.contains(tmp)!=true){

                ans.add(new ArrayList<>(tmp));

            }

            return;

        }

        for(int i=0;i<nums.length;i++){

            if(vis[i]==1) continue;

            vis[i] = 1;

            tmp.add(nums[i]);

            dfs(nums,position+1,tmp);

            tmp.remove(tmp.size()-1);

            vis[i] = 0;

        }

    }

}