77. Combinations

最新推荐文章于 2022-07-10 12:50:35 发布

这里是个记录贴

最新推荐文章于 2022-07-10 12:50:35 发布

阅读量90

点赞数

本文链接：https://blog.csdn.net/zzzyqsama/article/details/102465786

版权

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],
]
python:

class Solution:
    def combine(self, n: int, k: int) -> List[List[int]]:
        ans = []
        stack =[]
        x =  1
        while True:
            l = len(stack)
            if l==k:
                ans.append(stack[:])
            if l==k or n-x+1<k-l:
                if not stack:
                    return ans
                x = stack.pop()+1
            else:
                stack.append(x)
                x = x+1

java：