leetcode

func swap(nums []int, i int, j int) []int {
  temp := nums[i]
  nums[i] = nums[j]
    nums[j] = temp
   return nums
}

func quan(nums []int, flag int, res *[][]int) {
   lenN := len(nums)
    if flag == lenN {
        *res = append(*res, nums)
    } else {
     for i := flag; i < lenN; i++ {
            if nums[i] == nums[flag] && i != flag {
              continue
         }
            swap(nums, flag, i)
          var temp = make([]int, lenN)
         copy(temp, nums)
         quan(temp, flag+1, res)
      }
    }
}

func permuteUnique(nums []int) [][]int {
    sort.Ints(nums)
  var res [][]int
  p := &res
    quan(nums, 0, p)
 return *p
}