classSolution{publicintfib(int n){if(n ==0)return0;if(n ==1)return1;int x =0;int y =1;int tmp =0;for(int i =0; i < n -1; i++){
tmp = x;
x = y %1000000007;
y =(tmp + y)%1000000007;}return y;}}
不能用递归,会有大量重复计算,故用两个变量储存值,由下至上计算class Solution { public int fib(int n) { if (n == 0) return 0; if (n == 1) return 1; int x = 0; int y = 1; int tmp = 0; ...