313. Super Ugly Number(unsolved)

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.

解答：
这道题跟之前的丑数计算没太大区别，区别就在于不只是2,3,5，而是可以是指定的指数作为因子。那么我们就考虑用一个vector去存所有的质数，然后再用一个vector存这些质数分别指向res中的位置，res存的就是之前计算出来的丑数。

class Solution {
public:
    int nthSuperUglyNumber(int n, vector<int>& primes) {
        vector<int> res(1,1);
        vector<int> idx(primes.size(),0);
        while(res.size()<n)
        {
            vector<int> tmp;
            for(int i=0;i<primes.size();i++)
            {
                    tmp.push_back(res[idx[i]]*primes[i]);
            }
            int mn=INT_MAX;
            for(int i=0;i<tmp.size();i++)
            {
                   mn=min(mn,tmp[i]); 
            }
            for(int i=0;i<idx.size();i++)
            {
                if(mn==tmp[i]) idx[i]++;
            }

            res.push_back(mn);

        }
        return res.back();


    }
};