c#求n个数字的最小公倍数

private int GetZXGBS(params int[] parameters)
        {
            if (parameters.Length == 1)
                return parameters[0];
            List<int> resultList=new List<int>();
            if (parameters.Length % 2 == 0)
            {
                for (int i = 0; i < parameters.Length; i=i+2)
                {
                    int result=minGongBeiShu(parameters[i],parameters[i+1]);
                    resultList.Add(result);
                }
            }
            else
            {
                for (int i = 0; i < parameters.Length; i = i + 2)
                {
                    int result = minGongBeiShu(parameters[i], parameters[i + 1]);
                    resultList.Add(result);
                }
                resultList.Add(parameters[parameters.Length - 1]);
            }
            return GetZXGBS(resultList.ToArray());
        }

        public int minGongBeiShu(int n1, int n2)
        {
            int temp = Math.Max(n1, n2);
            n2 = Math.Min(n1, n2);//n2中存放两个数中最小的
            n1 = temp;//n1中存放两个数中最大的
            int product = n1 * n2;//求两个数的乘积
            while (n2 != 0)
            {
                n1 = n1 > n2 ? n1 : n2;//使n1中的数大于n2中的数
                int m = n1 % n2;
                n1 = n2;
                n2 = m;
            }
            return (product / n1);//最小公倍数
        }