313. Super Ugly Number **

来源：互联网发布：日本人皮肤知乎编辑：程序博客网时间：2024/04/29 08:15

Write a program to find the nth super ugly number.

Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [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] of size 4.

Note:
(1) 1 is a super ugly number for any given primes.
(2) The given numbers in primes are in ascending order.

(3) 0 < k ≤ 100, 0 < n ≤ 106, 0 < primes[i] < 1000.

My code:

class Solution(object):    def nthSuperUglyNumber(self, n, primes):        """        :type n: int        :type primes: List[int]        :rtype: int        """        if n<=0:  return False        t = [0]*len(primes)        uglyNumber = [0]*n                  uglyNumber[0] = 1        for i in range(1,n):              uglyNumber[i]=min([uglyNumber[t[j]]*primes[j] for j in range(len(primes))])            for j in range(len(primes)):                if uglyNumber[i] == uglyNumber[j]*primes[j]:                    t[j]+=1        return uglyNumber[n-1]

0 0