题解 | #斐波那契数列#
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution {
public:
int Fibonacci(int n) {
int a = 1;
int b = 1;
int res = 1;
for(int i=3; i<=n; i++){
res = a + b;
a = b;
b = res;
}
return res;
}
};
佬，我隔壁的
看到专升本+双非硕，我就知道，此事没那么简单