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

Update 0017.电话号码的字母组合.md

Browse Source
This commit is contained in:
jiyongchao
2024-03-31 11:19:54 +08:00
parent e3c4c20e5e
commit 96e9fcb3ad
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -260,7 +260,7 @@ class Solution {
} }
//每次迭代获取一个字符串，所以会设计大量的字符串拼接，所以这里选择更为高效的 StringBuilder //每次迭代获取一个字符串，所以会涉及大量的字符串拼接，所以这里选择更为高效的 StringBuilder
StringBuilder temp = new StringBuilder(); StringBuilder temp = new StringBuilder();
//比如digits如果为"23",num 为0，则str表示2对应的 abc //比如digits如果为"23",num 为0，则str表示2对应的 abc
@ -274,7 +274,7 @@ class Solution {
String str = numString[digits.charAt(num) - '0']; String str = numString[digits.charAt(num) - '0'];
for (int i = 0; i < str.length(); i++) { for (int i = 0; i < str.length(); i++) {
temp.append(str.charAt(i)); temp.append(str.charAt(i));
//c //递归，处理下一层
backTracking(digits, numString, num + 1); backTracking(digits, numString, num + 1);
//剔除末尾的继续尝试 //剔除末尾的继续尝试
temp.deleteCharAt(temp.length() - 1); temp.deleteCharAt(temp.length() - 1);