leetcode313

class Solution(object):
    def nthSuperUglyNumber(self, n, primes):
        """
        :type n: int
        :type primes: List[int]
        :rtype: int
        """
        primes.sort()
        num = len(primes)
        
        nums = [0,1]
        
        idxs = [1]*num
        
        while len(nums) < n+1:
         
            temps = [nums[idxs[i]]*primes[i] for i in range(num)]
            
            cur = min(temps)
            
            for j, temp in enumerate(temps):
                if cur == temp:
                    idxs[j] += 1
                    
            nums.append(cur)
        print(nums) 
        return nums[-1]