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

添加 0017.电话号码的字母组合.md Java版本

Browse Source
This commit is contained in:
nanhuaibeian
2021-05-12 22:23:51 +08:00
committed by GitHub
parent 7c85f8c337
commit 6437920758
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

@ -242,6 +242,7 @@ public:
Java： Java：
```Java ```Java
class Solution { class Solution {
//设置全局列表存储最后的结果 //设置全局列表存储最后的结果
List<String> list = new ArrayList<>(); List<String> list = new ArrayList<>();
@ -271,6 +272,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));
//回溯
backTracking(digits, numString, num + 1); backTracking(digits, numString, num + 1);
//剔除末尾的继续尝试 //剔除末尾的继续尝试
temp.deleteCharAt(temp.length() - 1); temp.deleteCharAt(temp.length() - 1);