方法一: 递归实现,代码简洁,但是效率较低
public class Solution {
public int Fibonacci(int n) {if(n<1)
{
return 0;
}
if( n <=2)
{
return 1;
}
return Fibonacci(n-1)+Fibonacci(n-2);
}
}
方法二:循环实现,提高效率
public class Solution {
public int Fibonacci(int n) {
if(n<1)
{
return 0;
}
if( n ==1)
{
return 1;
}
int fm1 = 1;
int fm2 = 0;
int fn = 0;
for(in