递归
class Solution {
public int Fibonacci(int n) {
if(n<=0)
return 0;
if(n==1)
return 1;
return Fibonacci(n-1)+Fibonacci(n-2);
}
}
递推
class Solution {
public int Fibonacci(int n) {
int[] result = {0,1};
if(n<2){
return result[n];
}
int min = 0;
int max = 1;
int now = 0;
for(int i = 2;i<=n;i++){
now = min + max;
min = max;
max = now;
}
return now;
}
}
MarkDown是个好东西啊