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.

class Solution {
    public int nthSuperUglyNumber(int n, int[] primes) {
        int len = primes.length;

        int[] result = new int[n];
        int[] idx = new int[len];
        result[0]= 1;

        for(int i=1;i<n;i++){
            result[i] = Integer.MAX_VALUE;
            for(int j=0;j<len;j++){
                result[i] = Math.min(result[i],primes[j]*result[idx[j]]);
            }

            for(int j=0;j<len;j++){
                if(result[i]%primes[j]==0) idx[j]++;
            }

        }

        return result[n-1];
    }
}

Source on what is ugly numbers:
Ugly numbers are numbers whose only prime factors are 2, 3 or 5