Combinations

最新推荐文章于 2024-09-14 19:55:48 发布

Goofiness

最新推荐文章于 2024-09-14 19:55:48 发布

阅读量117

点赞数

分类专栏： leetcode 文章标签： python leetcode

本文链接：https://blog.csdn.net/byr_wy/article/details/84640805

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

Combinations

Given two integers n and k, return all possible combinations of k numbers out of 1 … n.

Example

Input: n = 4, k = 2
Output:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]

Solution

#一天不写DFS就手生，佛了
class Solution(object):
    def combine(self, n, k):
        """
        :type n: int
        :type k: int
        :rtype: List[List[int]]
        """
        if n<=0 or n<k or k==0:
            return
        ret = []
        self.generate(1, [], ret, n, k)
        return ret
    
    def generate(self, start, templist, ret, n, k):
        if k==0:
            ret.append(templist)
            return
        if start<=n:
            for i in range(start, n+1):
                self.generate(i+1, templist+[i], ret, n, k-1)