letcode 77

letcode 77

给定两个整数 n 和 k，返回 1 … n 中所有可能的 k 个数的组合。

示例:

输入: n = 4, k = 2
输出:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]

• 递归

class Solution:
    def combine(self, n: int, k: int) -> List[List[int]]:
        res=[]
        def helper(nums,curr_nums):
            if(len(curr_nums)==k):
                res.append(curr_nums[:])
                return
            else:
                for i,v in enumerate(nums):
                    curr_nums.append(v)
                    helper(nums[i+1:],curr_nums)
                    curr_nums.pop()
        helper(range(1,n+1),[])
        return res

• 库函数

import itertools
class Solution:
    def combine(self, n: int, k: int) -> List[List[int]]:
        return list(itertools.combinations(range(1,n+1),k))