Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

1.提交斐波那契数列算法的Java版本更新 , 之前的fib(n - 2) + fib (n - 1) 方法的时间复杂度过大 , 无法接收; #13

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

miaodongCoder
Copy link

作者你好 , 请检查以下代码 , 如果觉得可以烦请合并我的代码 , 谢谢 , 你的这些LeetCode常见算法题对我的帮助很大 , 我也想尽我自己的一点力 ,帮助这份代码更完善一些;
之前在代码中写了很多注释 ,但是为了和你保持同样的风格我删除了无用的注释 , 烦请合并我的PR
Java版本的代码我都在leetCode上做了检验 , 斐波那契数列做了最多加到30的极限检验;

return 0;
public static int Fibonacci( int n ) {
if (n < 2) {
return 1;
Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

这里缩进要修改一下~

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant