题目1:求斐波那契数列的第n项
题目2:青蛙跳台问题
func fibonacci(n int) int {
arr := make([]int, n+1)
arr[1], arr[2] = 1, 1
for i := 3; i <= n; i++ {
arr[i] = arr[i-2] + arr[i-1]
}
return arr[n]
}
题目1:求斐波那契数列的第n项
题目2:青蛙跳台问题
func fibonacci(n int) int {
arr := make([]int, n+1)
arr[1], arr[2] = 1, 1
for i := 3; i <= n; i++ {
arr[i] = arr[i-2] + arr[i-1]
}
return arr[n]
}