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

update 0070.爬楼梯完全背包版本：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-11 11:46:51 +08:00
committed by GitHub
parent 6e62049cd3
commit 84b84e5bf1
1 changed files with 5 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0070.爬楼梯完全背包版本.md
View File

@ -101,6 +101,11 @@ public:
}; };
``` ```
* 时间复杂度: O(nm)
* 空间复杂度: O(n)
代码中m表示最多可以爬m个台阶，代码中把m改成2就是本题70.爬楼梯可以AC的代码了。 代码中m表示最多可以爬m个台阶，代码中把m改成2就是本题70.爬楼梯可以AC的代码了。
## 总结 ## 总结