프로그래머스-N개의 최소공배수

class Solution {
    public int solution(int[] arr) {
        int answer = lcm(arr[0],arr[1]);
        
        for(int i=2; i<arr.length; i++){
            answer=lcm(answer,arr[i]);
        }
        return answer;
    }
    
    private static int lcm(int i, int j){
        return i*j/gcd(i,j);
    }
    
    private static int gcd(int i, int j){
        int max= i<j?j:i;
        int min= i<j?i:j;
        
        if(max%min==0){
            return min;
        }else{
            return gcd(min,max%min);
        }
    }
}