<span>斐波那契数列 （循环方式）</span>

 1 class Solution {
 2 public:
 3     int Fibonacci(int n) {
 4         if(n == 0)
 5             return 0;
 6         if(n == 1)
 7             return 1;
 8         int i;
 9         long long temp1 = 1;
10         long long temp2 = 0;
11         long long temp = 0;
12         for (i=2;i<= n;i++){
13             temp = temp1+temp2;
14             temp2 = temp1;
15             temp1 = temp;
16         }
17         return temp;
18     }
19 };