leetcode313

import sys
class Solution:
    def nthSuperUglyNumber(self, n: int, primes: 'List[int]') -> int:
        dp = [1]*n
        m = len(primes)
        plist = [0] * m
        for i in range(1, n):
            cur = sys.maxsize
            for j in range(m):
                s = primes[j] * dp[plist[j]]
                if s < cur:
                    cur = s
            for j in range(m):
                s = primes[j] * dp[plist[j]]
                if cur == s:
                    plist[j] += 1
            dp[i] = cur
        return dp[-1]

算法思路：动态规划，本题是从 leetcode 264. Ugly Number II改造而来。