Easy Python from Ugly Number II


  • 0
    W
    class Solution(object):
        def nthSuperUglyNumber(self, n, primes):
            """
            :type n: int
            :type primes: List[int]
            :rtype: int
            """
            ug,ct, max_n=[0,1],1,float('inf')
            pr=[1 for i in range(len(primes))]
            while ct<=n:
                x=max_n
                for i in range(len(primes)):
                    while primes[i]*ug[pr[i]]<=ug[-1]:
                        pr[i]+=1
                    x=min(x,primes[i]*ug[pr[i]])
                ug.append(x)
                ct+=1
            return ug[n]

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.