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 313 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 313 # by problem number
lcpy gen -s super_ugly_number # by problem name
primes.
Given an integer n and an array of integers primes, return the nth super ugly number.
The nth super ugly number is guaranteed to fit in a 32-bit signed integer.
Input: n = 12, primes = [2,7,13,19]
Output: 32
Explanation: [1,2,4,7,8,13,14,16,19,26,28,32] is the sequence of the first 12 super ugly numbers given primes = [2,7,13,19].
Input: n = 1, primes = [2,3,5]
Output: 1
Explanation: 1 has no prime factors, therefore all of its prime factors are in the array primes = [2,3,5].
class Solution:
# Time: O(n * k) where k = len(primes)
# Space: O(n + k)
def nth_super_ugly_number(self, n: int, primes: list[int]) -> int:
ugly = [0] * n
ugly[0] = 1
idx = [0] * len(primes)
candidates = list(primes)
for i in range(1, n):
nxt = min(candidates)
ugly[i] = nxt
for j, prime in enumerate(primes):
if candidates[j] == nxt:
idx[j] += 1
candidates[j] = ugly[idx[j]] * prime
return ugly[n - 1]
| Time | Space |
|---|---|
| O(n * k) where k = len(primes) | O(n + k) |