-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path077组合.py
32 lines (27 loc) · 880 Bytes
/
077组合.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
# -*- coding:utf-8 -*-
__author__ = 'ShawDa'
class Solution:
def combine(self, n: int, k: int) -> List[List[int]]:
self.res, self.tmp = [], []
self.helper(n, k, 1)
return self.res
def helper(self, n, k, start):
if len(self.tmp) == k:
self.res.append(self.tmp.copy())
return
for i in range(start, n+1):
self.tmp.append(i)
self.helper(n, k, i+1)
self.tmp.pop()
def combine1(self, n: int, k: int):
self.res, self.tmp = [], []
self.helper1(n, k, 1)
return self.res
def helper1(self, n, k, start):
if len(self.tmp) == k:
self.res.append(self.tmp.copy())
return
for i in range(start, n-(k-len(self.tmp))+2):
self.tmp.append(i)
self.helper(n, k, i+1)
self.tmp.pop()