Leetcode 264. Ugly Number II

最新推荐文章于 2022-05-01 20:36:55 发布

SnailTyan

最新推荐文章于 2022-05-01 20:36:55 发布

阅读量225

点赞数

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.csdn.net/Quincuntial/article/details/81814453

版权

Leetcode 同时被 2 个专栏收录

409 篇文章 18 订阅

订阅专栏

Algorithm

260 篇文章 2 订阅

订阅专栏

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Ugly Number II

2. Solution

class Solution {
public:
    int nthUglyNumber(int n) {
        if(n == 1) {
            return 1;
        }
        int ugly[n] = {0};
        ugly[0] = 1;
        int two = 0;
        int three = 0;
        int five = 0;
        for(int i = 1; i < n; i++) {
            ugly[i] = min(min(ugly[two] * 2, ugly[three] * 3), ugly[five] * 5);
            if(ugly[i] == ugly[two] * 2) {
                two++;
            }
            if(ugly[i] == ugly[three] * 3) {
                three++;
            }
            if(ugly[i] == ugly[five] * 5) {
                five++;
            }
        }
        return ugly[n - 1];
    }
};