Super Ugly Number

最新推荐文章于 2022-08-30 15:42:26 发布

guoyuhaoaaa

最新推荐文章于 2022-08-30 15:42:26 发布

阅读量268

点赞数

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

本文链接：https://blog.csdn.net/guoyuhaoaaa/article/details/54807928

版权

leetcode 专栏收录该内容

8 篇文章 1 订阅

订阅专栏

Write a program to find the nth super ugly number.

Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13, 14, 16, 19, 26, 28, 32] is the sequence of the first 12 super ugly numbers given primes = [2, 7, 13, 19] of size 4.

class Solution {
public:
    int nthSuperUglyNumber(int n, vector<int>& primes) {
        int m=primes.size();
        vector<int> ans(n,1),index(m,0);
        for(int i=1;i<n;i++)
        {
            ans[i]=INT_MAX;
            for(int j=0;j<m;j++)
                ans[i]=min(ans[i],ans[index[j]]*primes[j]);

            for(int j=0;j<m;j++)
            {
                if(ans[i] == ans[index[j]]*primes[j])
                    index[j]++;
            }
        }
        return ans[n-1];
    }
};