class Solution {
List<List<Integer>> res;
public List<List<Integer>> permute(int[] nums) {
res = new ArrayList<>();
List track = new ArrayList<>();
backtrack(nums,track);
return res;
}
public void backtrack(int[] nums , List<Integer> track){
if(track.size() == nums.length){
res.add(new ArrayList<>(track));
}
for(int i = 0 ; i < nums.length ; i++){
if(track.contains(nums[i])){
continue;
}
track.add(nums[i]);
backtrack(nums,track);
track.remove(track.size()-1);
}
}
}