669. 组合:
代码思路
class Solution:
def combine(self, n: int, k: int) -> List[List[int]]:
combine = []
def bt(node, layer, lis):
if layer == k:
combine.append(lis)
return
for j in range(1, n-node+1):
bt(node+j, layer+1, lis+[node+j])
for i in range(1, n+1):
bt(i, 1, [i])
return combine