Leetcode Permutations

Given a collection of distinct numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:

[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]

Difficulty: Medium

Solution: Back-tracking

import java.util.Hashtable;

public class Solution {
    
    public void helper(List<List<Integer>> res, int[] nums, Hashtable<Integer, Integer> ht, List<Integer> curr){
        for(int i = 0; i < nums.length; i++){
            if(ht.get(nums[i]) == 1){
                ht.put(nums[i], 0);
                curr.add(nums[i]);
                if(curr.size() == nums.length){
                    res.add(new ArrayList(curr));
                    curr.remove(curr.size() - 1);
                    ht.put(nums[i], 1);
                }
                else{
                    helper(res, nums, ht, curr);
                    curr.remove(curr.size() - 1);
                    ht.put(nums[i], 1);
                }
                
            }
        }
        return;
    }
    
    public List<List<Integer>> permute(int[] nums) {
        Hashtable<Integer, Integer> ht = new Hashtable<Integer, Integer>();
        for(int i = 0; i < nums.length; i++){
            ht.put(nums[i], 1);
        }
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        List<Integer> temp = new ArrayList<Integer>();
        helper(res, nums, ht, temp);
        return res;
    }
}