leetcode 刷题 77 78

class Solution: def combine(self, n: int, k: int) -> List[List[int]]: def search(cur, remain): if remain == 0: return [[]] return [[c] + next for c in range(cur, n+2-remain) for next in search(c+1, remain-1)] return search(1, k)

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
 

class Solution(object): def combine(self, n, k): """ :type n: int :type k: int :rtype: List[List[int]] """ result = [] def dfs(stack, num, k): if k == 0: result.append(stack) return for i in reversed(range(1, num + 1)): if k > i: break dfs(stack + [i], i - 1, k - 1) dfs([], n, k) return result

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
 

class Solution: def subsets(self, nums: List[int]) -> List[List[int]]: d = [] d.append([]) for x in nums: l = len(d) for i in range(l): t = [x] d.append(t+d[i]) return d #一行
		#return [[x for b, x in zip(("{:0" + str(len(nums)) + "b}").format(n), nums) if b == '1'] for n in range(2 ** len(nums))]

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
 

文章来源: maoli.blog.csdn.net，作者：刘润森！，版权归原作者所有，如需转载，请联系作者。

原文链接：maoli.blog.csdn.net/article/details/90543887