leetcode 264 Ugly Number II（难易度：Medium）

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 first10 ugly numbers.

Note that 1 is typically treated as an ugly number.

Hint:

1. The naive approach is to callisUgly for every number until you reach the n^th one. Most numbers arenot 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: L₁, L₂, and L₃.
4. Assume you have U_k, the k^th ugly number. Then U_k+1 must be Min(L₁ * 2, L₂ * 3, L₃ * 5).

代码：

int Min(int num1, int num2, int num3);

int nthUglyNumber(int n) {
    if(n <= 0)
        return 0;
    int *pUglyNumbers =  (int *)malloc(n * sizeof(int));
    pUglyNumbers[0] = 1;
    int nextUglyIndex = 1;
    int *t2 = pUglyNumbers;
    int *t3 = pUglyNumbers;
    int *t5 = pUglyNumbers;
    while (nextUglyIndex < n)
    {
        int min = Min(*t2 * 2, *t3 * 3, *t5 * 5);
	pUglyNumbers[nextUglyIndex] = min;
	while (*t2 * 2 <= min)
            ++t2;
	while (*t3 * 3 <= min)
	    ++t3;
	while (*t5 * 5 <= min)
	    ++t5;
        ++nextUglyIndex;
    }
    int UglyNumber = pUglyNumbers[nextUglyIndex - 1];
    free(pUglyNumbers);
    return UglyNumber; 
}

int Min(int num1, int num2, int num3)
{
    int min = (num1 < num2) ? num1 : num2;
    return (min < num3) ? min : num3;
}

原题地址： https://leetcode.com/problems/ugly-number-ii/