【leetcode每日刷题】264. Ugly Number II

https://leetcode.com/problems/ugly-number-ii/submissions/

一、设置可以乘2，3，5的index，避免重复

二、每个index乘2，3，5之后选取最小的一个放在结果队列中。

三、更新index

class num264 {
    public int nthUglyNumber(int n) {
        int index2 = 0;
        int index3 = 0;
        int index5 = 0;
        int[] ugly = new int[n];
        ugly[0] = 1;
        for(int i=1; i<n; i++){
            int num2 = ugly[index2] * 2;
            int num3 = ugly[index3] * 3;
            int num5 = ugly[index5] * 5;
            ugly[i] = Math.min(num2, Math.min(num3, num5));
            if(ugly[i] == num2) index2 ++;
            if(ugly[i] == num3) index3 ++;
            if(ugly[i] == num5) index5 ++;
        }
        return ugly[n-1];
    }
}

 

来源：CSDN

作者：liff_lee

链接：https://blog.csdn.net/m0_38103546/article/details/104877038