264. Ugly Number II

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.
4. Assume you have Uk, the kth ugly number. Then Uk+1 must be Min(L1 * 2, L2 * 3, L3 * 5).

题意：计算第n个丑数。

思路：优先队列，每次拿出来一个，放进去3个；Ui表示第i个丑数，则Ui分别乘以2,3,5然后继续放进优先队列里，取出第i+1个。

class Solution {
public:
	int nthUglyNumber(int n) {
		if (n == 1)
			return n;
		priority_queue<long long, vector<long long>, std::greater<long long>> dp;
		long res = 1;
		while (--n){
			long long a, b, c;
			a = res * 2;
			b = res * 3;
			c = res * 5;
			dp.push(a);
			dp.push(b);
			dp.push(c);
			while(dp.top() == res)
			    dp.pop();
			res = dp.top();
			dp.pop();
		}
		return res;
	}
};

思路2：

我们知道丑陋数序列可以拆分为下面3个子列表：
(1) 1×2, 2×2, 3×2, 4×2, 5×2, …
(2) 1×3, 2×3, 3×3, 4×3, 5×3, …
(3) 1×5, 2×5, 3×5, 4×5, 5×5, …

仔细观察上述三个列表，列表里的每个值b都是一个丑数a分别乘以2,3,5，由于要维持一个大小顺序，每次计算出序列头的三个数值，然后取最小的值加入待生成的丑数序列，然后将序列对应的偏移往后移，指向下一个丑数（即a的next），类似于三个链表的合并。

class Solution {
public:
	int nthUglyNumber(int n) {
		vector<int> dp(n, 1);
		int i2, i3, i5;
		i2 = i3 = i5 = 0;
		int t = n - 1;
		while (t){
			int m2 = dp[i2] * 2;
			int m3 = dp[i3] * 3;
			int m5 = dp[i5] * 5;
			int m = min(m2, min(m3, m5));
			if (m2 == m)
				i2++;
			if (m3 == m)
				i3++;
			if (m5 == m)
				i5++;
			dp[n - t] = m;
			t--;
		}
		return dp[n - 1];
	}
};