編程實現——遞歸/非遞歸

public class Fibonacci {private static int fibonacci1(int n) {if(n <= 1) {return 1;} else {return fibonacci1(n - 1) + fibonacci1(n - 2);}}private static int fibonacci2(int n) {if(n <= 1) {return 1;}int last = 1;int nextToLast = 1;int answer = 1;for(int i = 2; i <= n; i++) {answer = last + nextToLast;nextToLast = last;last = answer;}return answer;}public static void main(String [] args) {System.out.println("fibonacci(10) = " + fibonacci1(10));System.out.println("fibonacci(10) = " + fibonacci2(10));}}

總結

以上是生活随笔為你收集整理的【Java】Fibonacci数列编程实现的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。