尝试将切片（阵列）存储在递归中的2D切片（阵列）中

Question

试图通过递归并找到子序列并将子序列切片（数组）在递归中的2D切片（数组）中进行，但在执行后获得NULL 2D切片后，将组合总和问题存储。对于组合总和问题（ https://leetcode.com/problems/problems/combination-combination-sum/ ）

通过地图，这是可能的

    package main
    
    import "fmt"
    
    func main() {
        sourceArr := []int{4, 8, 10, 17, 1, 2, 7}
        subSeq := make([]int, 0, len(sourceArr))
        arrayOfArr := make([][]int, 0)
        // i'm calling fuction passing the arguments
        FindCombinationV2(sourceArr, subSeq, 10, 0, arrayOfArr)
        //after execution i'm getting null array's in 2D array
        fmt.Printf("arrayOfArr: %v\n", arrayOfArr)
    }
    func FindCombinationV2(arr, subSequenceArr []int, target, index int, ans [][]int) {
        if index == len(arr) {
            if target == 0 {
                // i'm getting sub sequences of actual target sum
                // here i'm appending subSequence slice in ans 2D slice
                ans = append(ans, [][]int{subSequenceArr}...)
            }
            return
        }
        if target >= arr[index] {
            subSequenceArr = append(subSequenceArr, arr[index])
            FindCombinationV2(arr, subSequenceArr, target-arr[index], index, ans)
            subSequenceArr = subSequenceArr[:len(subSequenceArr)-1]
        }
    
        FindCombinationV2(arr, subSequenceArr, target, index+1, ans)
    
    }