class Solution:
def combine(self, n: int, k: int) -> List[List[int]]:
self.path = []
self.result = []
self.backtracking(n,k,1)
return self.result
def backtracking(self, n , k , start_index):
if len(self.path) == k:
self.result.append(self.path[:])
return
for i in range(start_index,n+1):
self.path.append(i)
self.backtracking(n,k,i+1)
self.path.pop()
注意在self.result.append(self.path[:])就是没问题的,self.result.append(self.path)就不行