264. Ugly Number II【 leetcode解题报告】

Description

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, and n does not exceed 1690.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

代码

class Solution {
public:
    //找到第n个丑数,每个丑数一定是由前面的丑数*2/3/5得到的
    int nthUglyNumber(int n) {
        vector<int> res(1,1);
        int i=0,j=0,k=0;
        while(res.size()<n){
            int num2=res[i]*2;
            int num3=res[j]*3;
            int num5=res[k]*5;
            res.push_back(min(num2,min(num3,num5)));
            //不能用 if-else 因为可能存在num2=num3、num2=num5...之类的情况
            if(res.back()==num2) ++i;
            if(res.back()==num3) ++j;
            if(res.back()==num5) ++k;
        }
        return res.back();
    }
};