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 0077.组合：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-27 15:35:27 +08:00
committed by GitHub
parent f97940758e
commit 7851e51c73
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0077.组合.md
View File

@ -218,6 +218,10 @@ public:
} }
}; };
``` ```
* 时间复杂度: O(n * 2^n)
* 空间复杂度: O(n)
还记得我们在[关于回溯算法，你该了解这些！](https://programmercarl.com/回溯算法理论基础.html)中给出的回溯法模板么？ 还记得我们在[关于回溯算法，你该了解这些！](https://programmercarl.com/回溯算法理论基础.html)中给出的回溯法模板么？