Fibonacci(斐波那契)数列的JAVA解法

1、Fibonacci（斐波那契）数列的JAVA解法fibonacci数列的递归算法public class Fib_rapublic static int fibonacci(int n)if(n>=0) if(n=0|n=1) return n; else return 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;n<m;n+)fibn=fibonacci(n);for(n=0;n<fib.len

2、gth;n+)计算斐波那契数列(Fibonacci)的第n个值public class Fibonacci public static void main(String args) int n = Integer.parseInt(args0); int n1 = 1;/第一个数 int n2 = 1;/第二个数 int sum = 0;/和 if(n<=0) return; if(n<=2) sum = 1; else for(int i=3;i<=n;i+) sum = n1+n2; n1 = n2; n2 = sum; 计算斐波那契数列(Fibonacci)的第n个值并

3、打印public class FibonacciPrint public static void main(String args) int n = Integer.parseInt(args0); FibonacciPrint t = new FibonacciPrint(); for(int i=1;i<=n;i+) t.print(i); public void print(int n) int n1 = 1;/第一个数 int n2 = 1;/第二个数 int sum = 0;/和 if(n<=0) return; if(n<=2) sum = 1; else for

4、(int i=3;i<=n;i+) sum = n1+n2; n1 = n2; n2 = sum; 输出Fibonacci数列public class Fibpublic static void main(String args)short i=0,j=1;doi=(short)(i+j);j=(short)(i+j);while(i>0);用一位数组保存Fibonacci序列值public class Fib_arraypublic static void main(String args)int n=25,i;int fib=new intn;fib0=0;fib1=1;for

5、(i=2;i<n;i+)fibi=fibi-1+fibi-2;for(i=0;i<fib.length;i+)用do-while输出Fibonacci数列public class Fibpublic static void main(String args)short i=0,j=1;doi=(short)(i+j);j=(short)(i+j);while(i>0);用一位数组保存Fibonacci序列值public class Fib_arraypublic static void main(String args)int n=25,i;int fib=new intn;