LeetCode 47. 全排列2Golang版
1. 问题描述
给定一个可包含重复数字的序列 nums ,按任意顺序 返回所有不重复的全排列。
2. 思路
回溯模板
3. 代码
func permuteUnique(nums []int) [][]int {
var res [][]int
var path []int
used := make([]bool, len(nums))
// 去重一定要先排序
sort.Ints(nums)
backtracking(nums, used, path, &res)
return res
}
func backtracking(nums []int, used []bool, path []int, res *[][]int) {
if len(path) == len(nums) {
temp := make([]int, len(path))
copy(temp, path)
fmt.Println(path)
*res = append(*res, temp)
return
}
for i := 0; i < len(nums); i++ {
// 去重关键
if i > 0 && nums[i - 1] == nums[i] && used[i - 1] == false {
continue
}
if used[i] == false {
used[i] = true
path = append(path, nums[i])
backtracking(nums, used, path, res)
path = path[:len(path) - 1]
used[i] = false
}
}
}