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.

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

类似于Ugly Number II那道题，把[2,3,5]对应的t2,t3,t5换成一个index数组，代码基本不变。代码如下：

public class Solution {
    public int nthSuperUglyNumber(int n, int[] primes) {
        int[] uglies = new int[n];
        int len = primes.length;
        int[] index = new int[len];
        /*for (int i = 0; i < n; i ++) {
            uglies[i] = Integer.MAX_VALUE;
        }*/
        uglies[0] = 1;
        for (int i = 1; i < n; i ++) {
            uglies[i] = Integer.MAX_VALUE;
            for (int j = 0; j < len; j ++) {
                if (uglies[i - 1] == uglies[index[j]] * primes[j])
                    index[j] ++;
                uglies[i] = Math.min(uglies[i], uglies[index[j]] * primes[j]);
            }
            /*for (int j = 0; j < len; j ++) {
                if (uglies[i] == uglies[index[j]] * primes[j])
                    index[j] ++;
            }*/ 
        }
        return uglies[n - 1];
    }
}

其中可以做一些优化，不用一开始全部初始化，改为在遍历的时候逐个初始化。判断哪个index该加1时，改为每次min之前判断。