第一項爲0,第二項爲1,以後的每項爲前兩項之和,代碼如下:
public class Solution {
public int Fibonacci(int n) {
int first = 0;
int second = 1;
if(n==0){
return first;
}
if(n==1){
return second;
}
for(int i=2;i<=n;i++){
int temp = first;
first = second;
second = temp+second;
}
return second;
}
}