Combinations

最新推荐文章于 2022-09-21 13:48:54 发布

真水壶

最新推荐文章于 2022-09-21 13:48:54 发布

阅读量597

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/enjoyuseless/article/details/39973659

leetcode 专栏收录该内容

154 篇文章

订阅专栏

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

For example,
If n = 4 and k = 2, a solution is:

[
  [2,4],
  [3,4],
  [2,3],
  [1,2],
  [1,3],
  [1,4],
]

class Solution:
    # @return a list of lists of integers
    def combine(self, n, k):
        #位向量
        ret=[]
        for i in range(1<<n):
            unit=[]
            counter=0
            for j in range(n):
                if (1<<j)&i !=0:
                    counter=counter+1
                    unit.append(j+1)
                    if counter>k:
                        break
            if counter==k:
                ret.append(unit)
        return ret