使用指针追加到切片 [][]int 时出错

Error when using pointers to append into slice [][]int

当我试图解决来自 LC 的问题“Subset II”时,我遇到了一个奇怪的问题。该代码从给定的集合生成幂集。 但是,当我 运行 代码失败时,因为其中一组不正确。

集合 [0,3,5,7] 替换为 [0,3,5,9](因此被追加两次)。

我在将集合附加到 res 之前有一个打印语句(在代码中突出显示),它打印出正确的幂集。

我能想到的唯一问题是使用指针将值追加到一个切片中,但是由于它不会同时 运行 我不明白为什么会有竞争条件。 如果有人能指出我的错误,我将不胜感激。

package main

import (
    "fmt"
    "sort"
)

func ValueCount( nums []int) map[int]int{
  hm := make(map[int]int)
  for _,v := range(nums){
    if c, ok := hm[v]; ok {
      hm[v] = c + 1
    }else{
      hm[v] = 1
    }
  }
  return hm
}

func subsetsWithDup(nums []int) [][]int {
    var res [][]int
    res = append(res,[]int{})
    sort.Ints(nums)
  hashMap := ValueCount(nums)
  var t []int
  printTest(nums, t, &res, hashMap)
    return res
}


func printTest(nums []int, t []int, res *[][]int, hm map[int]int) {
  if len(nums) == 0 {
    return
  }
  for i:= 0; i < len(nums); {
    v := nums[i]
    x := nums[i:]
    for  k:= 0; k< hm[v]; k++ {
      var a,b []int
      for z:= 0; z<k+1; z++ { 
        a = append(t,x[z])
      }
      fmt.Println(a) // <--------- Prints the values that gets appended to res
      *res = append(*res, a)    
      b = a
      printTest(nums[i+hm[v]:], b, res, hm)
    }
    i += hm[v]
  }
  
}

func main(){
    n := []int{9,0,3,5,7}
    fmt.Println("Find the power set of:", n)
    fmt.Println(subsetsWithDup(n))
}

// [0,3,5,7] changes to 
// [0,3,5,9] in the output

非常小心 使用(和重复使用)切片结果 - 特别是在稍后更改这些切片值时。由于切片具有支持数组,因此引用的数据可以在 very unexpected ways!

中更改

快速解决问题的方法是将切片结果复制到新切片。这确保对原始切片的更改不会引入错误(尤其是在递归算法中)。

要复制切片:

func copyIntSlice(a []int) []int {
    c := make([]int, len(a))
    copy(c, a) // `a` can now grow/shrink/change without affecting `c`
    return c
}

然后从您的主代码中调用它:

aCopy := copyIntSlice(a)
*res = append(*res, aCopy)

printTest(nums[i+hm[v]:], aCopy, res, hm)

https://play.golang.org/p/1p8Z4sV9foQ

错误出现在第 40 行:

a = append(t, x[z])

一个快速的解决方法是改变这个 for 循环:

        for k := 0; k < hm[v]; k++ {
            var a, b []int
            for z := 0; z < k+1; z++ {
                a = append(t, x[z])
            }
            fmt.Println(a) // <--------- Prints the values that gets appended to res
            *res = append(*res, a)
            b = a
            printTest(nums[i+hm[v]:], b, res, hm)
        }

为此:

        for k := 0; k < hm[v]; k++ {
            var a, b []int
            a = make([]int, len(t))
            copy(a, t)
            for z := 0; z < k+1; z++ {
                a = append(a, x[z])
            }
            fmt.Println(a) // <--------- Prints the values that gets appended to res
            *res = append(*res, a)
            b = a
            printTest(nums[i+hm[v]:], b, res, hm)
        }

这与 Go 如何使用切片作为数据结构有关。当内置 append 函数的第一个参数是切片参数时,它会复制一些切片的内部数据,这对程序员来说并不直观。然后它修改了参数切片 t 和新创建的切片 a.

如果您有兴趣了解更多信息,我建议您继续阅读 slice internals

已编辑完整节目:

package main

import (
    "fmt"
    "sort"
)

func ValueCount(nums []int) map[int]int {
    hm := make(map[int]int)
    for _, v := range nums {
        if c, ok := hm[v]; ok {
            hm[v] = c + 1
        } else {
            hm[v] = 1
        }
    }
    return hm
}

func subsetsWithDup(nums []int) [][]int {
    var res [][]int
    res = append(res, []int{})
    sort.Ints(nums)
    hashMap := ValueCount(nums)
    var t []int
    printTest(nums, t, &res, hashMap)
    return res
}

func printTest(nums []int, t []int, res *[][]int, hm map[int]int) {
    if len(nums) == 0 {
        return
    }
    for i := 0; i < len(nums); {
        v := nums[i]
        x := nums[i:]
        for k := 0; k < hm[v]; k++ {
            var a, b []int
            a = make([]int, len(t))
            copy(a, t)
            for z := 0; z < k+1; z++ {
                a = append(a, x[z])
            }
            fmt.Println(a) // <--------- Prints the values that gets appended to res
            *res = append(*res, a)
            b = a
            printTest(nums[i+hm[v]:], b, res, hm)
        }
        i += hm[v]
    }

}

func main() {
    n := []int{9, 0, 3, 5, 7}
    fmt.Println("Find the power set of:", n)
    fmt.Println(subsetsWithDup(n))
}

新输出:

Find the power set of: [9 0 3 5 7]
[0]
[0 3]
[0 3 5]
[0 3 5 7]
[0 3 5 7 9]
[0 3 5 9]
[0 3 7]
[0 3 7 9]
[0 3 9]
[0 5]
[0 5 7]
[0 5 7 9]
[0 5 9]
[0 7]
[0 7 9]
[0 9]
[3]
[3 5]
[3 5 7]
[3 5 7 9]
[3 5 9]
[3 7]
[3 7 9]
[3 9]
[5]
[5 7]
[5 7 9]
[5 9]
[7]
[7 9]
[9]
[[] [0] [0 3] [0 3 5] [0 3 5 7] [0 3 5 7 9] [0 3 5 9] [0 3 7] [0 3 7 9] [0 3 9] [0 5] [0 5 7] [0 5 7 9] [0 5 9] [0 7] [0 7 9] [0 9] [3] [3 5] [3 5 7] [3 5 7 9] [3 5 9] [3 7] [3 7 9] [3 9] [5] [5 7] [5 7 9] [5 9] [7] [7 9] [9]]