Package g0301_0400.s0313_super_ugly_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    313 - Super Ugly Number\.

    Medium

    A super ugly number is a positive integer whose prime factors are in the array primes.

    Given an integer n and an array of integers primes, return the <code>n<sup>th</sup></code> super ugly number.

    The <code>n<sup>th</sup></code> super ugly number is guaranteed to fit in a 32-bit signed integer.

    Example 1:

    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.

    Example 2:

    Input: n = 1, primes = 2,3,5

    Output: 1

    Explanation: 1 has no prime factors, therefore all of its prime factors are in the array primes = 2,3,5.

    Constraints:

    • <code>1 <= n <= 10<sup>5</sup></code>

    • 1 &lt;= primes.length &lt;= 100

    • 2 &lt;= primes[i] &lt;= 1000

    • primes[i] is guaranteed to be a prime number.

    • All the values of primes are unique and sorted in ascending order.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer nthSuperUglyNumber(Integer n, IntArray primes)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait