build

2025-07-25 03:08:54 +08:00 · 2024-04-13 21:17:44 +08:00
parent 9332a91e26
commit 6afa70e7bc
55 changed files with 334 additions and 182 deletions
--- a/en/docs/chapter_computational_complexity/iteration_and_recursion.md
+++ b/en/docs/chapter_computational_complexity/iteration_and_recursion.md
@ -1992,6 +1992,7 @@ Therefore, **we can use an explicit stack to simulate the behavior of the call s
        var res = 0
        // 递: 递归调用
        for (i in n downTo 0) {
+            // 通过“入栈操作”模拟“递”
            stack.push(i)
        }
        // 归: 返回结果