/*
 * @lc app=leetcode.cn id=47 lang=golang
 *
 * [47] 全排列 II
 */

// @lc code=start
func permuteUnique(nums []int) (res [][]int) {
	if len(nums) == 1 {
		res = [][]int{{nums[0]}}
		return
	}
	sort.Ints(nums)
	for i := 0; i < len(nums); i++ {
		if i > 0 && nums[i] == nums[i-1] {
			continue
		}
		dd := make([]int, len(nums))
		copy(dd, nums)
		temp := permuteUnique(append(dd[:i], dd[i+1:]...))
		for _, v := range temp {
			res = append(res, append([]int{nums[i]}, v...))
		}
	}
	return
}

// @lc code=end