题目:
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的扩展,所以思路和原来也是完全一致的。我们需要定义一个表示Super Ugly Number的数组nums,以及一个位置数组pos,其代表的含义是:假设pos[i] == j,则表示nums[j] * j的结果将是第一个大于nums的最后一个元素的数。这样思路就比较清楚了,采用如下方法求下一个Super Ugly Number:
1)根据pos数组和prime数组的记录,找到nums[pos[i]] * primes[i]生成的Super Ugly Number中的最小的一个,并加入到nums数组中。
2)根据当前nums数组中的最后一个元素,更新pos数组中的各个索引。
该算法的时间复杂度是O(nm),空间复杂度是O(n + m),其中m是primes数组中的素数个数。
代码:
class Solution {
public:
int nthSuperUglyNumber(int n, vector<int>& primes) {
vector<int> nums(n, INT_MAX); // the ugly numbers
vector<int> pos(primes.size(), 0); // pos means the index in nums
nums[0] = 1;
for(int cur = 1; cur < n; ++cur) {
for(int i = 0; i < pos.size(); ++i) { // Find multiple which prime can produce minimum val
nums[cur] = min(nums[cur], nums[pos[i]] * primes[i]);
}
for(int i = 0; i < pos.size(); ++i) { // Update primes positions (now the nums[cur] has been calculated)
while(nums[pos[i]] * primes[i] <= nums[cur]) {
++pos[i];
}
}
}
return nums[n - 1];
}
};