313. Super Ugly Number **

最新推荐文章于 2024-06-04 11:57:06 发布

Yingying_code

最新推荐文章于 2024-06-04 11:57:06 发布

阅读量212

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/alwaystry/article/details/52190122

版权

leetcode 专栏收录该内容

261 篇文章 0 订阅

订阅专栏

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]