LeetCode 0313 - Super Ugly Number

Reck Zhang

发布于 2021-08-11 11:14:22

2370

发布于 2021-08-11 11:14:22

文章被收录于专栏：Reck Zhang

Super Ugly Number

Desicription

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.

Example:

Input: n = 12, primes = [2,7,13,19]
Output: 32 
Explanation: [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 is a super ugly number for any given primes.
The given numbers in primes are in ascending order.
0 < k ≤ 100, 0 < n ≤ 106, 0 < primes[i] < 1000.
The nth super ugly number is guaranteed to fit in a 32-bit signed integer.

Solution

class Solution {
public:
    int nthSuperUglyNumber(int n, std::vector<int>& primes) {
        auto index = std::vector<int>(primes.size(), 0);
        auto uglys = std::vector<int>(n, INT_MAX);
        uglys[0] = 1;

        for(auto& ugly : uglys) {
            for(int i = 0; i < index.size(); i++) {
                ugly = std::min(ugly, uglys[index[i]] * primes[i]);
            }
            for(int i = 0; i < index.size(); i++) {
                if(ugly == uglys[index[i]] * primes[i]) {
                    index[i]++;
                }
            }
        }

        return uglys[uglys.size() - 1];
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2019-05-14，如有侵权请联系 cloudcommunity@tencent.com 删除

integer