mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
61fec83242
* Create gaussian.py * Update gaussian.py * Update gaussian.py * Create gaussian.png * Add files via upload * Create prime_factors.py * Update prime_factors.py * Update prime_factors.py
53 lines
1.1 KiB
Python
53 lines
1.1 KiB
Python
"""
|
|
python/black : True
|
|
"""
|
|
from typing import List
|
|
|
|
|
|
def prime_factors(n: int) -> List[int]:
|
|
"""
|
|
Returns prime factors of n as a list.
|
|
|
|
>>> prime_factors(0)
|
|
[]
|
|
>>> prime_factors(100)
|
|
[2, 2, 5, 5]
|
|
>>> prime_factors(2560)
|
|
[2, 2, 2, 2, 2, 2, 2, 2, 2, 5]
|
|
>>> prime_factors(10**-2)
|
|
[]
|
|
>>> prime_factors(0.02)
|
|
[]
|
|
>>> x = prime_factors(10**241) # doctest: +NORMALIZE_WHITESPACE
|
|
>>> x == [2]*241 + [5]*241
|
|
True
|
|
>>> prime_factors(10**-354)
|
|
[]
|
|
>>> prime_factors('hello')
|
|
Traceback (most recent call last):
|
|
...
|
|
TypeError: '<=' not supported between instances of 'int' and 'str'
|
|
>>> prime_factors([1,2,'hello'])
|
|
Traceback (most recent call last):
|
|
...
|
|
TypeError: '<=' not supported between instances of 'int' and 'list'
|
|
|
|
"""
|
|
i = 2
|
|
factors = []
|
|
while i * i <= n:
|
|
if n % i:
|
|
i += 1
|
|
else:
|
|
n //= i
|
|
factors.append(i)
|
|
if n > 1:
|
|
factors.append(n)
|
|
return factors
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|