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 0078.子集：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-27 16:33:52 +08:00
committed by GitHub
parent 65f059ac7a
commit 33d5a6878e
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0078.子集.md
View File

@ -149,6 +149,8 @@ public:
};
```
* 时间复杂度: O(n * 2^n)
* 空间复杂度: O(n)
在注释中，可以发现可以不写终止条件，因为本来我们就要遍历整棵树。