# # # leetcode77 # 给定两个整数n和k,返回范围[1, n]中所有可能的k个数的组合。 # 你可以按任何顺序返回答案。 # # # # 示例1: # 输入:n = 4, k = 2 # 输出: # [ # [2, 4], # [3, 4], # [2, 3], # [1, 2], # [1, 3], # [1, 4], # ] # # 示例2: # 输入:n = 1, k = 1 # 输出:[[1]] n = 4 k = 2 path = [] res = [] def combination(start_index,n, k, path,res): if len(path) == k: res.append(path[:]) for i in range(start_index, n+1): path.append(i) combination(i+1, n, k, path, res) path.pop() return res print(combination(1,n, k, path,res))