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

update 0017.电话号码的字母组合：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-27 16:02:29 +08:00
committed by GitHub
parent 9a29e5c3be
commit 025854e167
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0017.电话号码的字母组合.md
View File

@ -183,6 +183,8 @@ public:
}
};
```
* 时间复杂度: O(3^m * 4^n)，其中 m 是对应四个字母的数字个数，n 是对应三个字母的数字个数
* 空间复杂度: O(3^m * 4^n)
一些写法，是把回溯的过程放在递归函数里了，例如如下代码，我可以写成这样：（注意注释中不一样的地方）