剑指offer——斐波那契数列

题目

思路

C++实现

class Solution {
public:
int Fibonacci(int n) {
if(n == 0){
return 0;
}
if (n == 1){
return 1;
}
int a = 0;
int b = 1;
int c = 0;
int i = 1;
while(i <= n){
a = b;
b = c;
c = a + b;
i++;
}
return c;
}
};