面试题49：丑数

题目描述
把只包含质因子2、3和5的数称作丑数（Ugly Number）。例如6、8都是丑数，但14不是，因为它包含质因子7。 习惯上我们把1当做是第一个丑数。求按从小到大的顺序的第N个丑数。
方法一：逐个计算累加，超时。

class Solution {
public:
    bool isUglyNumber(int num)
    {
        if(num <=0)
            return false;
        while(num % 2 == 0)
            num /= 2;
        while(num % 3 == 0)
            num /= 3;
        while(num %= 5)
            num /= 5;
        return (num == 1) ? true : false;
    }

    int GetUglyNumber_Solution(int index) {
        if(index <= 0)
            return false;
        int num = 0;
        int cnt = 0;
        while(cnt < index)
        {
            num ++;
            if(isUglyNumber(num))
                cnt ++;
        }
        return num;
    }
};

方法二：

class Solution {
public:
    int GetUglyNumber_Solution(int index) {
        if(index <= 0)
            return false;
        int *pUglyNum = new int[index];
        pUglyNum[0] = 1;
        int nextUglyIndex = 1;
        int *pMultiply2 = pUglyNum;
        int *pMultiply3 = pUglyNum;
        int *pMultiply5 = pUglyNum;

        while(nextUglyIndex < index)
        {
            int minUgly = min(*pMultiply2 * 2, min(*pMultiply3 * 3, *pMultiply5 * 5));
            pUglyNum[nextUglyIndex] = minUgly;//只对丑数操作，节省时间
            while(*pMultiply2 * 2 <= pUglyNum[nextUglyIndex])
                ++ pMultiply2;
            while(*pMultiply3 * 3 <= pUglyNum[nextUglyIndex])
                ++ pMultiply3;            
            while(*pMultiply5 * 5 <= pUglyNum[nextUglyIndex])
                ++ pMultiply5;
            nextUglyIndex ++;
        }
        int res = pUglyNum[nextUglyIndex - 1];
        delete[] pUglyNum;
        return res;
    }
};

简洁版：

class Solution {
public:
   int GetUglyNumber_Solution(int index) {
        if (index < 7)return index;
        vector<int> res(index);
        res[0] = 1;
        int t2 = 0, t3 = 0, t5 = 0, i;
        for (i = 1; i < index; ++i)
        {
            res[i] = min(res[t2] * 2, min(res[t3] * 3, res[t5] * 5));//两次比较
            if (res[i] == res[t2] * 2)t2++;
            if (res[i] == res[t3] * 3)t3++;
            if (res[i] == res[t5] * 5)t5++;
        }
        return res[index - 1];
    }
};