簡體   English   中英

Java中的遞歸

[英]recursion in java

給定此方法調用:

public class MainClass {

public static void main(String[] args) {
    System.out.println(fib(3));
}

private static int fib(int i) {
     System.out.println("Into fib with i = " + i);

    if (i < 2) {
        System.out.println("We got here");
        return i;
    }
    return fib(i-1) + fib(i-2); 
}

 }

我期望:

* fib(i-1) to return 2
* fib(i-2) to return 1
* return 2 + 1 to return 3

結果:

2

這是控制台的輸出:

Into fib with i = 3
Into fib with i = 2
Into fib with i = 1
We got here
Into fib with i = 0
We got here

我了解到這部分的一切:

Into fib with i = 0

我什么時候可以成為0?

fib(3)調用fib(2) 調用fib(2) ,它將調用fib(i-1)fib(i-2) ,即fib(1)fib(0)

暫無
暫無

聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.

 
粵ICP備18138465號  © 2020-2024 STACKOOM.COM