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 
self.s 语法纠正
This commit is contained in:
Asterisk
2021-09-02 17:15:42 +08:00
committed by GitHub
parent 6609258c0a
commit 15e342e00b
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -322,20 +322,20 @@ python3：
```py ```py
class Solution: class Solution:
def letterCombinations(self, digits: str) -> List[str]: def letterCombinations(self, digits: str) -> List[str]:
self.s = ""
res = [] res = []
s = ""
letterMap = ["","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"] letterMap = ["","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"]
if len(digits) == 0: return res if not len(digits): return res
def backtrack(digits,index): def backtrack(digits,index, s):
if index == len(digits): if index == len(digits):
return res.append(self.s) return res.append(s)
digit = int(digits[index]) #将index指向的数字转为int digit = int(digits[index]) #将index指向的数字转为int
letters = letterMap[digit] #取数字对应的字符集 letters = letterMap[digit] #取数字对应的字符集
for i in range(len(letters)): for i in range(len(letters)):
self.s += letters[i] s += letters[i]
backtrack(digits,index + 1) #递归，注意index+1，一下层要处理下一个数字 backtrack(digits, index+1, s) #递归，注意index+1，一下层要处理下一个数字
self.s = self.s[:-1] #回溯 s = s[:-1] #回溯
backtrack(digits,0) backtrack(digits, 0, s)
return res return res
``` ```