algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 0055.跳跃游戏：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-11 00:30:07 +08:00
committed by GitHub
parent 80006ad615
commit 85f54a718d
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0055.跳跃游戏.md
View File

@ -75,6 +75,10 @@ public:
}; };
``` ```
* 时间复杂度: O(n)
* 空间复杂度: O(1)
## 总结 ## 总结
这道题目关键点在于：不用拘泥于每次究竟跳几步，而是看覆盖范围，覆盖范围内一定是可以跳过来的，不用管是怎么跳的。 这道题目关键点在于：不用拘泥于每次究竟跳几步，而是看覆盖范围，覆盖范围内一定是可以跳过来的，不用管是怎么跳的。