<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                企業??AI智能體構建引擎,智能編排和調試,一鍵部署,支持知識庫和私有化部署方案 廣告
                >[success] # 遞歸練習 * 遞歸本質就是指在方法體的內部**直接或間接調用當前方法自身**的形式 * 遞歸必須有遞歸的規律以及**退出條件** >[danger] ##### 實現數n的階乘 ~~~ public class SumTest { // 非遞歸 int factorial(int num) { int sum = 1; for (int i = 1; i <= num; i++) { sum *= i; } return sum; } // 使用遞歸 int recursionFactorial(int num) { if (num == 1) { return 1; } return num * recursionFactorial(num - 1); } public static void main(String[] args) { SumTest sumTest = new SumTest(); int a = sumTest.factorial(5); // 120 int b = sumTest.recursionFactorial(5); // 120 System.out.println(a + "," + b); } } ~~~ >[danger] ##### 斐波那契數列 * 非遞歸思路 ![](https://img.kancloud.cn/bb/eb/bbebdd00e516460465470f22e9a954fe_1258x524.png) ~~~ public class SumTest { // 非遞歸 利用指針 int fibonacci(int index) { int a = 1; int b = 1; int c = b; while (index >= 3) { b = a + c; a = c; c = b; index--; } return b; } // 使用遞歸 int recursionFibonacci(int index) { if (index == 1 || index == 2) { return 1; } return recursionFibonacci(index - 1) + recursionFibonacci(index - 2); } public static void main(String[] args) { SumTest sumTest = new SumTest(); int a = sumTest.fibonacci(6); // 8 int b = sumTest.recursionFibonacci(6); // 8 System.out.println(a + "," + b); } } ~~~
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看