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.
题意:给定一个素数序列,根据这个素数序列生成第n个超级丑数,超级丑数:1和质因子为这些数的数。
思路:类似于Ugly Number II, 由3个序列合并改为由primes.size()个序列进行合并。
class Solution {
public:
int nthSuperUglyNumber(int n, vector<int>& primes) {
int m = primes.size();
vector<int> index(m, 0);
vector<int> temp(m, 0);
vector<int> res(n, 1);
int t = n - 1;
while (t){
for (int i = 0; i < m; i++)
temp[i] = res[index[i]] * primes[i];
int minNum = *min_element(temp.begin(), temp.end());
for (int i = 0; i < m; i++){
if (temp[i] == minNum)
index[i]++;
}
res[n - t] = minNum;
t--;
}
return res[n - 1];
}
};