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

[pull] master from youngyangyang04:master #495

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

Merged
pull merged 10 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Oct 26, 2024
Merged
Changes from 1 commit
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
5fb0a12
feat: 127. 骑士的攻击增加js解法
suinming Oct 1, 2024
07d219e
更正复杂度分析中的笔误
shengyufan Oct 4, 2024
2b7fc7d
删除冗余代码,增加详细注释
shengyufan Oct 4, 2024
91137dc
fix: Errata 输出输出->输入输出
Jasonyou-boy Oct 3, 2024
4eef086
feat: 0100.岛屿最大面积 Java实现
Jasonyou-boy Oct 4, 2024
9c7131e
feate: 字符串接龙 Java优化版并修复存在问题
Jasonyou-boy Oct 5, 2024
31a9066
Merge branch 'master' into feature/nextString
youngyangyang04 Oct 21, 2024
c0fef4b
Merge pull request #2770 from suinming/kamacoder-127-js
youngyangyang04 Oct 26, 2024
835fd6d
Merge pull request #2772 from shengyufan/master
youngyangyang04 Oct 26, 2024
46c48c9
Merge pull request #2777 from Jasonyou-boy/feature/nextString
youngyangyang04 Oct 26, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
更正复杂度分析中的笔误
  • Loading branch information
shengyufan committed Oct 4, 2024
commit 07d219ecd1fb75337d6d5722a1b63635e4f19057
2 changes: 1 addition & 1 deletion problems/0452.用最少数量的箭引爆气球.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -110,7 +110,7 @@ public:
```

* 时间复杂度:O(nlog n),因为有一个快排
* 空间复杂度:O(1),有一个快排,最差情况(倒序)时,需要n次递归调用。因此确实需要O(n)的栈空间
* 空间复杂度:O(n),有一个快排,最差情况(倒序)时,需要n次递归调用。因此确实需要O(n)的栈空间

可以看出代码并不复杂。

Expand Down

AltStyle によって変換されたページ (->オリジナル) /