FilesExpand file tree

 master

/

factor-combinations.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

23 lines (21 loc) · 641 Bytes

 master

/

factor-combinations.py

Copy path

Top

File metadata and controls

• Code
• Blame

23 lines (21 loc) · 641 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

# Time: O(nlogn)

# Space: O(logn)

class Solution:

# @param {integer} n

# @return {integer[][]}

def getFactors(self, n):

result = []

factors = []

self.getResult(n, result, factors)

return result

def getResult(self, n, result, factors):

i = 2 if not factors else factors[-1]

while i <= n / i:

if n % i == 0:

factors.append(i);

factors.append(n / i);

result.append(list(factors));

factors.pop();

self.getResult(n / i, result, factors);

factors.pop()

i += 1