github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

更新图片链接

Browse Source
This commit is contained in:
kama
2025-05-19 17:11:04 +08:00
parent b489cb69b5
commit ce6e658d14
315 changed files with 2499 additions and 1729 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0017.电话号码的字母组合.md Normal file → Executable file
View File

@@ -11,7 +11,7 @@
给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。
![17.电话号码的字母组合](https://file.kamacoder.com/pics/2020102916424043.png)
![17.电话号码的字母组合](https://file1.kamacoder.com/i/algo/2020102916424043.png)
示例:
* 输入："23"
@@ -64,7 +64,7 @@ const string letterMap[10] = {
例如：输入："23"，抽象为树形结构，如图所示：
![17. 电话号码的字母组合](https://file.kamacoder.com/pics/20201123200304469.png)
![17. 电话号码的字母组合](https://file1.kamacoder.com/i/algo/20201123200304469.png)
图中可以看出遍历的深度，就是输入"23"的长度，而叶子节点就是我们要收集的结果，输出["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]。