programmers_N개의 최소공배수_java

https://school.programmers.co.kr/learn/courses/30/lessons/12953

프로그래머스

import java.util.*;

class Solution {
    public int solution(int[] arr) {
        int answer = 0;
        
        int arrLength = arr.length;
        int before = arr[0];
        for(int i = 1; i<arrLength; i++){
            before = findGCD(before, arr[i]);
        }
        answer = before;
        return answer;
    }
    
    // 최대공약수 찾기
    public int findLCM(int a, int b){   
        int big = Math.max(a, b);
        int small = Math.min(a, b); 
        while(small != 0){
            int tmp = big % small;
            big = small;
            small = tmp;
        }
        
        return big;
    }
    // 최소 공배수 찾기
    public int findGCD(int a, int b){
        return (a*b) / findLCM(a, b);
    }
}