diff --git a/problems/0017.电话号码的字母组合.md b/problems/0017.电话号码的字母组合.md
index 0a69c69c..fa135d8d 100644
--- a/problems/0017.电话号码的字母组合.md
+++ b/problems/0017.电话号码的字母组合.md
@@ -282,6 +282,43 @@ class Solution {
 ```
 
 Python：
+
+```Python
+class Solution:
+    ans = []
+    s = ''
+    letterMap = {
+        '2': 'abc',
+        '3': 'def',
+        '4': 'ghi',
+        '5': 'jkl',
+        '6': 'mno',
+        '7': 'pqrs',
+        '8': 'tuv',
+        '9': 'wxyz'
+    }
+
+    def letterCombinations(self, digits):
+        self.ans.clear()
+        if digits == '':
+            return self.ans
+        self.backtracking(digits, 0)
+        return self.ans
+
+    def backtracking(self, digits, index):
+        if index == len(digits):
+            self.ans.append(self.s)
+            return
+        else:
+            letters = self.letterMap[digits[index]]  # 取出数字对应的字符集
+            for letter in letters:
+                self.s = self.s + letter  # 处理
+                self.backtracking(digits, index + 1)
+                self.s = self.s[:-1]      # 回溯
+```
+
+python3：
+
 ```python3
 class Solution:
     def letterCombinations(self, digits: str) -> List[str]:
@@ -302,6 +339,7 @@ class Solution:
         return res
 ```
 
+
 Go：