LCR 080. 组合(LeetCode-力扣-Python)

最新推荐文章于 2024-07-25 19:34:38 发布

zy20221209

最新推荐文章于 2024-07-25 19:34:38 发布

阅读量185

点赞数 2

文章标签： leetcode python

本文链接：https://blog.csdn.net/zy20221209/article/details/136935995

版权

def subsets_2(nums):
    res = [[]]
    for num in nums:
        res += [i + [num] for i in res]
    return res
class Solution(object):


    def combine(self, n, k):
        """
        :type n: int
        :type k: int
        :rtype: List[List[int]]
        """
        crr = []
        arr = [i for i in range(1, n+1)]
        brr = subsets_2(arr)
        for val in brr:
            if len(val) == k:
                crr.append(val)
        return crr