1、Fibonacci（斐波那契）数列的 JAVA 解法fibonacci 数列的递归算法public class Fib_rapublic static int fibonacci(int n)if(n=0)if(n=0|n=1)return n;elsereturn fibonacci(n-2)+fibonacci(n-1);return -1;public static void main(String args)int m=25,n;int fib=new intm;for(n=0;n0);System.out.println();用一位数组保存 Fibonacci 序列值public c
2、lass Fib_arraypublic static void main(String args)int n=25,i;int fib=new intn;fib0=0;fib1=1;for(i=2;i0);System.out.println();用一位数组保存 Fibonacci 序列值public class Fib_arraypublic static void main(String args)int n=25,i;int fib=new intn;fib0=0;fib1=1;for(i=2;in;i+)fibi=fibi-1+fibi-2;for(i=0;ifib.length;i+)System.out.print(“+fibi);System.out.println();
