首页 > 代码库 > [leetcode] Combinations @ Python [ask for help]
[leetcode] Combinations @ Python [ask for help]
https://oj.leetcode.com/problems/combinations/
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): return self.combineRecur([], n, k, 1) def combineRecur(self, current, n, k, i): if k == 0: return [current] if i > n: return [] return self.combineRecur(current, n, k, i + 1) + self.combineRecur(current + [i], n, k - 1, i + 1)
[leetcode] Combinations @ Python [ask for help]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。