Leetcode 313. super ugly number

Write a program to find the n^th 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.

这道题和ugly number II 思路一样，关键是保留指针p，这个指针表明了下一次再乘p_i的时候应该和前面的哪一个ugly number相乘。

 class Solution(object):
     def nthSuperUglyNumber(self, n, primes):
         """
         :type n: int
         :type primes: List[int]
         :rtype: int
         """
         res = [1]*n
         m = len(primes)
         p = [-1]*m
         v = [1]*m

         for k in range(n):
             res[k] = min(v)
             for j in range(m):
                 if v[j] == res[k]:
                     p[j] += 1
                     v[j] = res[p[j]]*primes[j]
         return res[-1]