313. Super Ugly Number

最新推荐文章于 2021-08-09 01:14:55 发布

kakitgogogo

最新推荐文章于 2021-08-09 01:14:55 发布

阅读量200

点赞数

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

本文链接：https://blog.csdn.net/kakitgogogo/article/details/51166945

版权

leetcode 专栏收录该内容

230 篇文章 0 订阅

订阅专栏

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.

Note:
(1) 1 is a super ugly number for any given primes.
(2) The given numbers in primes are in ascending order.
(3) 0 < k ≤ 100, 0 < n ≤ 106, 0 < primes[i] < 1000.

跟 264. Ugly Number II 相识，只是把2,3,5三个数换成了m个素数。

代码(112ms)：

class Solution {
public:
    int nthSuperUglyNumber(int n, vector<int>& primes) 
    {
    vector<int>res(n);
    res[0]=1;
    int m=primes.size();
    vector<int>index(m,0);
    for(int i=1;i<n;i++)
    {
        int tmp=0x7FFFFFFF;
        for(int j=0;j<m;j++) tmp=min(tmp,primes[j]*res[index[j]]);
        res[i]=tmp;
        for(int j=0;j<m;j++)
        {
            if(primes[j]*res[index[j]]<=tmp) index[j]++;
        }
    }
    return res[n-1];
    }
};