LeetCode-313.Super Ugly Number

https://leetcode.com/problems/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.

这道题与题264非常相似  LeetCode-264.Ugly Number ，只是质数的个数不是3个

public class Solution
{
    public int NthSuperUglyNumber(int n, int[] primes) 
    {
        int m = primes.Length;
        List<int> list = new List<int>();
        list.Add(1);
        int[,] arr = new int[2, m];
        int num;
        while (list.Count<n)
        {
            for (int i = 0; i < m; i++)
                arr[1, i] = list[arr[0, i]] * primes[i];
            num = GetMin(arr);
            for (int i = 0; i < m; i++)
            {
                if (num == arr[1, i])
                    arr[0, i]++;
            }
            list.Add(num);
        }
        return list[n - 1];
    }
    
    private int GetMin(int[,] arr)
    {
        int min = arr[1, 0];
        for (int i = 1; i < arr.GetLongLength(1); i++)
        {
            if (arr[1, i] < min)
                min = arr[1, i];
        }
        return min;
    }
}

优化

public int NthSuperUglyNumber(int n, int[] primes) 
    {
        int m = primes.Length;
        List<int> list = new List<int>();
        list.Add(1);
        int[] arr = new int[m];
        int min;
        while (list.Count<n)
        {
            min = list[arr[0]] * primes[0];
            for (int i = 1; i < m; i++)
                min =Math.Min(min,list[arr[i]] * primes[i]);
            for (int i = 0; i < m; i++)
            {
                if (min == list[arr[i]] * primes[i])
                    arr[i]++;
            }
            list.Add(min);
        }
        return list[n - 1];
    }