/*
    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.
    
    Analysis:
    similar to ugly number 2, DP
    d[i] = Math.min(min, d[i-1]*primes[j])
    example:   6 [2,3,7] 
    2*[1],3*[1],7*[1] compare 2,3,7
    [1,2]->2*[2],3*[1,2],7*[1,2] compare [4,3,7]
    ....
    Time O(n*(primes.length))
*/

public class Solution {
    public int nthSuperUglyNumber(int n, int[] primes) {
        int[] d =new int[n];
        d[0]=1;
        int[] p = new int[primes.length];
        Arrays.fill(p,0);
        for(int i=1;i<n;i++){
            int min = Integer.MAX_VALUE;
            for(int j=0;j<primes.length;j++){
                min = Math.min(min,primes[j]*d[p[j]]) ;
            }
            d[i]=min;
            for(int k =0;k<primes.length;k++){
                if(min == primes[k]*d[p[k]]){
                    p[k]++;
                }
            }
        }
        return d[n-1];
    }
}

@@ -848,16 +848,17 @@
 nt%5B%5D d =
+ 
 new int%5B
@@ -873,17 +873,19 @@
     d%5B0%5D
-=
+ = 
 1;%0A     
@@ -968,13 +968,17 @@
 nt i
-=1;i%3C
+ = 1;i %3C 
 n;i+
@@ -1047,13 +1047,18 @@
 nt j
-=0;j%3C
+ = 0; j %3C 
 prim
@@ -1067,16 +1067,17 @@
 .length;
+ 
 j++)%7B%0A  
@@ -1118,17 +1118,19 @@
 rimes%5Bj%5D
-*
+ * 
 d%5Bp%5Bj%5D%5D)
@@ -1162,17 +1162,19 @@
     d%5Bi%5D
-=
+ = 
 min;%0A   
@@ -1197,12 +1197,16 @@
  k =
+ 
 0;
-k%3C
+ k %3C 
 prim
@@ -1215,16 +1215,17 @@
 .length;
+ 
 k++)%7B%0A  
@@ -1257,17 +1257,19 @@
 rimes%5Bk%5D
-*
+ * 
 d%5Bp%5Bk%5D%5D)

Update SuperUglyNumber.java