HDOJ-ACM1019(JAVA) 多个数的最小公倍数

import java.util.*;

import java.io.*;

public class Main{

    public static void main(String[] arg){
        Scanner scan = new Scanner(new BufferedInputStream(System.in));
        int n =scan.nextInt();
        int[] nums = new int[1001];
        while(n--!=0){
            int m = scan.nextInt();
            for(int i = 0 ; i != m ; i ++ ){
                nums[i] = scan.nextInt();
            }
            int lcm = 1;
            for(int i = 0 ; i != m ; i ++ ){
                lcm = getLCM(lcm,nums[i]);
            }
            System.out.println(lcm);
        }
        scan.close();

    }

    static int getLCM(int a,int b){//最小公倍数LCM为乘积除以最大公约数GCD
        return b*a/getGCD(a, b);
    }

    static int getGCD(int a,int b){//求最大公约数，辗转相除法
        while(b%a!=0){
            int temp = b%a;
            b = a;
            a = temp;
        }
        return a;
    };

}

static int getLCM(int a,int b){//最小公倍数LCM为乘积除以最大公约数GCD
        b=b/getGCD(a, b);
        return b*a;
}