Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 625 with 14 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 625 # by problem number
lcpy gen -s minimum_factorization # by problem name
num, return the smallest positive integer x whose multiplication of each digit equals num. If there is no answer or the answer is not fit in 32-bit signed integer, return 0.
Input: num = 48
Output: 68
Input: num = 15
Output: 35
1 <= num <= 2^31 - 1class Solution:
# Time: O(log(num) * 8)
# Space: O(log(num))
def smallest_factorization(self, num: int) -> int:
if num < 10:
return num
digits: list[int] = []
for d in range(9, 1, -1):
while num % d == 0:
num //= d
digits.append(d)
if num != 1:
return 0
result = 0
for d in reversed(digits):
result = result * 10 + d
return result if result <= 2**31 - 1 else 0
| Time | Space |
|---|---|
| O(log(num) * 8) | O(log(num)) |