Go - 带有数组和丢失值的递归结构

func recursiveFunc(arr []int, i int) {
    if i < len(arr) {
        recursiveFunc(arr, i+1)
    }
}

func main() {
    arr := []int{1, 2, 3, 4, 5}
    recursiveFunc(arr, 0)
}

func recursiveFunc(arr map[int]int, i int) {
    if val, ok := arr[i]; ok {
        return
    }
    arr[i] = i
    recursiveFunc(arr, i+1)
}

func main() {
    arr := map[int]int{1: 1, 2: 2, 3: 3, 4: 4, 5: 5}
    recursiveFunc(arr, 0)
}

func recursiveFunc(arr chan int, i int) {
    if i < len(arr) {
        recursiveFunc(arr, i+1)
    }
}

func main() {
    arr := []int{1, 2, 3, 4, 5}
    recursiveFunc(arr, 0)
}

func recursiveFunc(arr []int, i int, result int) {
    if i < len(arr) {
        result = arr[i] + result
        recursiveFunc(arr, i+1, result)
    }
}

func main() {
    arr := []int{1, 2, 3, 4, 5}
    result := 0
    recursiveFunc(arr, 0, result)
}