Leetcode 313: Super Ugly Number

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.
(4) The nth super ugly number is guaranteed to fit in a 32-bit signed integer.

 

 1 public class Solution {
 2     public int NthSuperUglyNumber(int n, int[] primes) {
 3         var dp = new int[n];
 4         dp[0] = 1;
 5              
 6         for (int i = 1; i < n; i++)
 7         {
 8             dp[i] = Int32.MaxValue;
 9             var shouldCut = false;
10             
11             for (int j = i - 1; j >= 0; j--)
12             {
13                 for (int k = primes.Length - 1; k >= 0; k--)
14                 {
15                     if (primes[k] * dp[j] <= dp[i - 1])
16                     {
17                         if (k == primes.Length - 1)
18                         {
19                             shouldCut = true;
20                         }
21                         
22                         break;
23                     }
24                     
25                     dp[i] = Math.Min(dp[i], primes[k] * dp[j]);
26                     
27                     if (shouldCut) break;
28                 }
29             }
30         }
31         
32         return dp[n - 1];
33     }
34 }

 

转载于:https://www.cnblogs.com/liangmou/p/8009145.html