Merge pull request #237 from jojoo15/patch-20

修改 0077.组合 python3版本

problems/0077.组合.md

@@ -370,23 +370,21 @@ class Solution {
 
 
 Python：
-```python
+```python3
 class Solution:
-    result: List[List[int]] = []
-    path: List[int] = []
     def combine(self, n: int, k: int) -> List[List[int]]:
-      self.result = []
+        res=[]  #存放符合条件结果的集合
-      self.combineHelper(n, k, 1)
+        path=[]  #用来存放符合条件结果
-      return self.result
+        def backtrack(n,k,startIndex):
-
+            if len(path) == k:
-    def combineHelper(self, n: int, k: int, startIndex: int):
+                res.append(path[:])
-      if  (l := len(self.path)) == k:
+                return 
-        self.result.append(self.path.copy())
+            for i in range(startIndex,n+1):
-        return
+                path.append(i)  #处理节点 
-      for i in range(startIndex, n - (k - l) + 2):
+                backtrack(n,k,i+1)  #递归
-        self.path.append(i)
+                path.pop()  #回溯，撤销处理的节点
-        self.combineHelper(n, k, i + 1)
+        backtrack(n,k,1)
-        self.path.pop()
+        return res
 ```
 javascript
 ```javascript