题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution { public: int Fibonacci(int n) { if (n<=1) { return n; } int* fib=new int[n+1]; fib[0]=0; fib[1]=1; for(int i=2;i<=n;i++) fib[i]=fib[i-1]+fib[i-2]; return fib[n]; } };