如何在Kotlin中尝试每种可能的排列

fun permute(nums: IntArray): List<List<Int>> {
    val result = mutableListOf<List<Int>>()
    backtrack(nums, mutableListOf(), result)
    return result
}

fun backtrack(nums: IntArray, tempList: MutableList<Int>, result: MutableList<List<Int>>) {
    if (tempList.size == nums.size) {
        result.add(tempList.toList())
    } else {
        for (i in nums.indices) {
            if (tempList.contains(nums[i])) continue
            tempList.add(nums[i])
            backtrack(nums, tempList, result)
            tempList.removeAt(tempList.size - 1)
        }
    }
}