尝试将java中的回溯代码转换为javascript

public class BacktrackingExample {
    public void backtrack(int[] nums, List<List<Integer>> result, List<Integer> tempList) {
        if (tempList.size() == nums.length) {
            result.add(new ArrayList<>(tempList));
        } else {
            for (int i = 0; i < nums.length; i++) {
                if (tempList.contains(nums[i])) {
                    continue;
                }
                tempList.add(nums[i]);
                backtrack(nums, result, tempList);
                tempList.remove(tempList.size() - 1);
            }
        }
    }

    public List<List<Integer>> permute(int[] nums) {
        List<List<Integer>> result = new ArrayList<>();
        backtrack(nums, result, new ArrayList<>());
        return result;
    }
}

function backtrack(nums, result, tempList) {
    if (tempList.length === nums.length) {
        result.push([...tempList]);
    } else {
        for (let i = 0; i < nums.length; i++) {
            if (tempList.includes(nums[i])) {
                continue;
            }
            tempList.push(nums[i]);
            backtrack(nums, result, tempList);
            tempList.pop();
        }
    }
}

function permute(nums) {
    const result = [];
    backtrack(nums, result, []);
    return result;
}