1.提交斐波那契数列算法的Java版本更新 , 之前的fib(n - 2) + fib (n - 1) 方法的时间复杂度过大 , 无法接收; #13
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
miaodongCoder
commented
Mar 10, 2023
| return 0; | ||
| public static int Fibonacci( int n ) { | ||
| if (n < 2) { | ||
| return 1; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
作者你好 , 请检查以下代码 , 如果觉得可以烦请合并我的代码 , 谢谢 , 你的这些LeetCode常见算法题对我的帮助很大 , 我也想尽我自己的一点力 ,帮助这份代码更完善一些;
之前在代码中写了很多注释 ,但是为了和你保持同样的风格我删除了无用的注释 , 烦请合并我的PR
Java版本的代码我都在leetCode上做了检验 , 斐波那契数列做了最多加到30的极限检验;