# 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.

public int nthSuperUglyNumber(int n, int[] primes) {
int[] arr=new int[n];
int[] points=new int[primes.length];//每个质数的指针
arr[0]=1;
for(int i=1;i<n;i++){//小的那个指针+1，但是不用互相比较，只要求出最小的值，再判断是否相等就行了
arr[i]=arr[points[0]]*primes[0];//初始情况
for(int j=0;j<points.length;j++){
arr[i]=arr[i]<arr[points[j]]*primes[j]?arr[i]:arr[points[j]]*primes[j];
}
for(int j=0;j<points.length;j++){
if(arr[points[j]]*primes[j]==arr[i]) points[j]++;
}
}
return arr[n-1];
}