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


