[programmers][XX] N개의 최소공배수

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

유클리드 호제법

class Solution {
    public int solution(int[] arr) {
        int answer = arr[0];

        for(int i = 1 ; i < arr.length ; i++){
            answer = least(arr[i], answer);
        }

        return answer;
    }

    private int least(int a, int b){
        return (a*b)/gcd(a,b);
    }

    private int gcd(int a, int b){
        while(b!=0){
            int temp = a%b;
            a = b;
            b = temp;
        }
        return a;
    }
}

© 2023 Lee. All rights reserved.