题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=295&tqId=23255&ru=%2Fpractice%2F7a71a88cdf294ce6bdf54c899be967a2&qru=%2Fta%2Fformat-top101%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D295
没啥好说的，递归和动态规划的入门。
开始刷动态规划了。
class Solution {
public:
int Fibonacci(int n) {
int fir = 0, sec = 1, res = 1;
for (int i = 2; i <= n; ++i) {
res = fir + sec;
fir = sec;
sec = res;
}
return res;
}
};
三环集团公司福利 311人发布
