用Java实现斐波那契数列
代码
public class fibonacci {
public static int Fibonacci1(int i){
if(i == 0 )
{
return 0;
}
else if (i == 1)
{
return 1;
}
else
{
return Fibonacci1(i-1) + Fibonacci1(i - 2);
}
}
public static int Fibonacci2(int n){
if(n<=1){
return n;
}
int[] fs = new int[n+1];
fs[0] = 0;
fs[1] = 1;
for(int i = 2; i <= n; i++){
fs[i] = fs[i-2] + fs[i-1];
}
return fs[n];
}
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
System.out.println( "请输入你要找的斐波那契数列位数:" );
System.out.println( "结果是"+Fibonacci1(input.nextInt()) );
System.out.println( "结果是"+Fibonacci2(input.nextInt()) );
}
}