LeetCode-in-All
46. Permutations
Medium
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
Example 1:
Input: nums = [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
Example 2:
Input: nums = [0,1]
Output: [[0,1],[1,0]]
Example 3:
Input: nums = [1]
Output: [[1]]
Constraints:
1 <= nums.length <= 6-10 <= nums[i] <= 10- All the integers of
numsare unique.
Solution
func permute(nums []int) [][]int {
if len(nums) == 0 {
return [][]int{}
}
finalResult := [][]int{}
permuteRecur(nums, &finalResult, []int{}, make([]bool, len(nums)))
return finalResult
}
func permuteRecur(nums []int, finalResult *[][]int, currResult []int, used []bool) {
if len(currResult) == len(nums) {
temp := make([]int, len(currResult))
copy(temp, currResult)
*finalResult = append(*finalResult, temp)
return
}
for i := 0; i < len(nums); i++ {
if used[i] {
continue
}
currResult = append(currResult, nums[i])
used[i] = true
permuteRecur(nums, finalResult, currResult, used)
used[i] = false
currResult = currResult[:len(currResult)-1]
}
}