g0001_0100.s0046_permutations.solution.ts Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
// #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
// #Udemy_Backtracking/Recursion #Big_O_Time_O(n*n!)_Space_O(n+n!)
// #2023_09_30_Time_56_ms_(96.26%)_Space_45.7_MB_(55.35%)

function permute(nums: number[]): number[][] {
    const result: number[][] = []
    const permuteRecursive = (nums: number[], index: number, result: number[][]) => {
        if (index >= nums.length) {
            result.push([...nums])
        }
        for (let i = index; i < nums.length; i++) {
            ;[nums[index], nums[i]] = [nums[i], nums[index]]
            permuteRecursive(nums, index + 1, result)
            ;[nums[index], nums[i]] = [nums[i], nums[index]]
        }
    }
    permuteRecursive(nums, 0, result)
    return result
}

export { permute }