Fibonacci(斐波那契)數列(一)

來源:互聯網
上載者:User

 

//fibonacci數列的遞迴演算法public class Fib_ra{public 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 int[m];for(n=0;n<m;n++)fib[n]=fibonacci(n);for(n=0;n<fib.length;n++)System.out.print(" "+fib[n]);System.out.println();}}//計算斐波那契數列(Fibonacci)的第n個值public class Fibonacci{    public static void main(String args[]){        int n = Integer.parseInt(args[0]);        int n1 = 1;//第一個數        int n2 = 1;//第二個數        int sum = 0;//和        if(n<=0){            System.out.println("參數錯誤!");            return;        }        if(n<=2){            sum = 1;                   }else{            for(int i=3;i<=n;i++){                sum = n1+n2;                n1 = n2;                n2 = sum;            }        }        System.out.println(sum);    }}//計算斐波那契數列(Fibonacci)的第n個值並列印public class FibonacciPrint{    public static void main(String args[]){        int n = Integer.parseInt(args[0]);        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){            System.out.println("參數錯誤!");            return;        }        if(n<=2){            sum = 1;                   }else{            for(int i=3;i<=n;i++){                sum = n1+n2;                n1 = n2;                n2 = sum;            }        }        System.out.println(sum);    }}//輸出Fibonacci數列public class Fib{public static void main(String args[]){short i=0,j=1;do{System.out.print(""+i+""+j);i=(short)(i+j);j=(short)(i+j);}while(i>0);System.out.println();}}用一位元組儲存Fibonacci序列值public class Fib_array{public static void main(String args[]){int n=25,i;int fib[]=new int[n];fib[0]=0;fib[1]=1;for(i=2;i<n;i++)fib[i]=fib[i-1]+fib[i-2];for(i=0;i<fib.length;i++)System.out.print(""+fib[i]);System.out.println();}}//用do-while輸出Fibonacci數列public class Fib{public static void main(String args[]){short i=0,j=1;do{System.out.print(""+i+""+j);i=(short)(i+j);j=(short)(i+j);}while(i>0);System.out.println();}}//用一位元組儲存Fibonacci序列值public class Fib_array{public static void main(String args[]){int n=25,i;int fib[]=new int[n];fib[0]=0;fib[1]=1;for(i=2;i<n;i++)fib[i]=fib[i-1]+fib[i-2];for(i=0;i<fib.length;i++)System.out.print(""+fib[i]);System.out.println();}}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.