剑指Offer系列49—丑数

最新推荐文章于 2022-04-23 14:32:12 发布

fkuner

最新推荐文章于 2022-04-23 14:32:12 发布

阅读量146

点赞数

分类专栏：剑指Offer

本文链接：https://blog.csdn.net/younothings/article/details/109284467

版权

剑指Offer 专栏收录该内容

57 篇文章 0 订阅

订阅专栏

代码

class Solution {
public:
    int nthUglyNumber(int n) {
        int a = 0, b = 0, c = 0;
        vector<int> uglyNumbers(n,0);
        uglyNumbers[0] = 1;
        for(int i = 1; i < n; i++){
            uglyNumbers[i] = min(min(uglyNumbers[a]*2, uglyNumbers[b]*3), uglyNumbers[c]*5);
            if(uglyNumbers[i] == uglyNumbers[a]*2) a++;
            if(uglyNumbers[i] == uglyNumbers[b]*3) b++;
            if(uglyNumbers[i] == uglyNumbers[c]*5) c++;
        }
        return uglyNumbers[n-1];
    }
};