Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def backtrackComb(n, k, idx, temp, res):
- # terminal condition
- if len(temp) == k:
- res.append(temp)
- return
- # recursive call
- for i in range(idx, n + 1): #由于在python中的 for loop 是“左闭右开”区间,所以这里要用n+1
- backtrackComb(n, k, i + 1, temp + [i], res)
- return
- def combine(n, k):
- """
- :type n: int
- :type k: int
- :rtype: List[List[int]]
- """
- res = []
- # 这道题 n 所代表的是 [1,2,3, ..., n], 所以遍历要从1开始
- backtrackComb(n, k, 1, [], res)
- return res
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement