斐波那契數列【java實現】
阿新 • • 發佈:2019-04-02
put inpu main imp ner stat system ann void
java 實現斐波那契數列 以下是Java代碼實現(遞歸與遞推兩種方式): import java.util.Scanner; /** * Fibonacci * * @author tongqian.zhang */ public class Fibonacci { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.println("Please input this fibonacci n:"); int n = scanner.nextInt(); // 假設輸入為大於零的整數 System.out.println(fibonacci(6) + ":" + fibonacciNormal(6)); int sum = 0; for(int i = 1; i <= n; i++){ sum += fibonacci(i); } System.out.println(sum); }// 遞歸實現方式 public static int fibonacci(int n){ if(n <= 2){ return 1; }else{ return fibonacci(n-1) + fibonacci(n-2); } } // 遞推實現方式 public static int fibonacciNormal(int n){if(n <= 2){ return 1; } int n1 = 1, n2 = 1, sn = 0; for(int i = 0; i < n - 2; i ++){ sn = n1 + n2; n1 = n2; n2 = sn; } return sn; } }
斐波那契數列【java實現】