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

Merge pull request #2109 from Logenleedev/local-edit

Browse Source 
添加复杂度分析
This commit is contained in:
程序员Carl
2023-06-14 09:16:27 +08:00
committed by GitHub
parent ff982b0fbd 2a61ec45e6
commit ec6c3e9d7e
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0047.全排列II.md
View File

@ -98,6 +98,8 @@ public:
} }
}; };
// 时间复杂度: 最差情况所有元素都是唯一的。复杂度和全排列1都是 O(n! * n) 对于 n 个元素一共有 n! 中排列方案。而对于每一个答案，我们需要 O(n) 去复制最终放到 result 数组
// 空间复杂度: O(n) 回溯树的深度取决于我们有多少个元素
``` ```
* 时间复杂度: O(n) * 时间复杂度: O(n)
* 空间复杂度: O(n) * 空间复杂度: O(n)