102：Super Ugly Number

题目：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.
(4) The nth super ugly number is guaranteed to fit in a 32-bit signed integer.

该题目和 Ugly Number II 的求解几乎一模一样，代码如下：

// 时间复杂度 O(n)，空间复杂度 O(n)
class Solution {
public:
        int nthSuperUglyNumber(int n, vector<int>& primes) {
                // sun 表示 super ugly number
                vector<int> sun(1, 1) // 第一个元素为 1

                // primes[i] 对应在数组 sun 中的位置为 idx[i]
                vector<int> idx(primes.size(), 1);
                while (sun.size() < n) {
                        int tmp = 0;
                        for (int i = 0; i < primes.size(); ++i)
                                tmp = min(tmp, primes[i] * sun[idx[i] -1]);

                        for (int i = 0; i < primes.size(); ++i)
                                if (tmp == primes[i] * sun[idx[i] - 1])
                                        ++idx;

                        if (tmp != sun.back()) sun.push_back(tmp);
                }
                return sun.back();
        }
};