斐波那契数列

题目描述

public class Solution {
public int Fibonacci(int n) {
if(n==1)
return 1;
if(n==2)
return 1;
int result=0;
int a=1;
int b=1;
for(int i=3;i<=n;i++){
result = a+b;
a=b;
b=result;
}
return result;
}
}

public class Solution {
public int Fibonacci(int n) {
if(n==0)
return 0;
if(n==1)
return 1;
return Fibonacci(n-1)+Fibonacci(n-2);
}
}