Skip to content

Commit ddd42d1

Browse files
committed
Update all solutions' changes in 2025-04-27.
1 parent d8fbae2 commit ddd42d1

File tree

4 files changed

+872
-326
lines changed

4 files changed

+872
-326
lines changed

en/1-1000/509-fibonacci-number.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -52,8 +52,8 @@ Recursion is an important concept in computer science and mathematics, which ref
5252
### The core idea of ​​recursion
5353

5454
- **Self-call**: A function calls itself during execution.
55-
- **Termination condition**: Recursion must have a termination condition to prevent infinite loops.
56-
- **Recursive equation**: Through equations, the problem gradually approaches the "termination condition".
55+
- **Base case**: Equivalent to the termination condition. After reaching the base case, the result can be returned without recursive calls to prevent infinite loops.
56+
- **Recursive step**: The step by which the problem gradually approaches the "base case".
5757

5858
## Complexity
5959

0 commit comments

Comments
 (0)