Write a program to find the n-th ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ugly numbers.
Note that 1 is typically treated as an ugly number.
Hint:
1.The naive approach is to call isUgly for every number until you reach the nth one. Most numbers are not ugly. Try to focus your effort on generating only the ugly ones.
2.An ugly number must be multiplied by either 2, 3, or 5 from a smaller ugly number.
3.The key is how to maintain the order of the ugly numbers. Try a similar approach of merging from three sorted lists: L1, L2, and L3.
Assume you have Uk, the kth ugly number. Then Uk+1 must be Min(L1 * 2, L2 * 3, L3 * 5).
用一个长度为n的数组res记录前n个丑数。用index1,index2,index3表示某丑数的索引。res[index1],res[index2],res[index3]分别与2,3,5相乘可得下一个可能的丑数,选其乘积最小的作为下一个丑数,然后更新索引。
代码(20ms):
class Solution {
public:
int nthUglyNumber(int n)
{
int num[3]={2,3,5};
vector<int>res(n);
res[0]=1;
int index[3]={0,0,0};
for(int i=1;i<n;i++)
{
int tmp=0x7FFFFFFF;
for(int j=0;j<3;j++) tmp=min(tmp,num[j]*res[index[j]]);
res[i]=tmp;
for(int j=0;j<3;j++)
{
if(num[j]*res[index[j]]<=tmp) index[j]++;
}
}
return res[n-1];
}
};