Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitddd42d1

Browse files
committed
Update all solutions' changes in 2025-04-27.
1 parentd8fbae2 commitddd42d1

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 atermination condition to prevent infinite loops.
56-
-**Recursiveequation**:Through equations,the problem gradually approaches the "termination condition".
55+
-**Base case**:Equivalent to thetermination condition. After reaching the base case, the result can be returned without recursive calls to prevent infinite loops.
56+
-**Recursivestep**:The step by whichthe problem gradually approaches the "base case".
5757

5858
##Complexity
5959

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp