2019獨角獸企業(yè)重金招聘Python工程師標準>>>

public class FibonacciTest {public static void main(String args[]){long start = System.nanoTime();System.out.println(fibonacci(30));long end = System.nanoTime();System.out.println("Time " + (end - start));System.out.println(fibonacci1(30));long end1 = System.nanoTime();System.out.println("Time " + (end1 - end));}public static int fibonacci(int n){//System.out.println(n);int result = 0;if(n == 0){result = 0;} else if(n == 1) {result = 1;} else {return fibonacci(n - 1) + fibonacci(n - 2);}return result;}public static int fibonacci1(int n){int result = 0;if( n == 0){return 0;} else if(n == 1){return 1;} else {int first = 0;int second = 1;for(int i = 2; i <= n; i++){result = first + second;first = second;second = result;}}return result;} }

轉(zhuǎn)載于:https://my.oschina.net/u/138995/blog/308307

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎勵來咯，堅持創(chuàng)作打卡瓜分現(xiàn)金大獎

總結(jié)

以上是生活随笔為你收集整理的Fibonacci递归非递归方法的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。