[JAVA] 프로그래머스 Lv.2 : N개의 최소공배수

예제:

 

arr	result
[2, 6, 8, 14]	168
[1, 2, 3]	6

---

Solution #1

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

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

        return answer;
    }

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

 

Result #1

 

---

 

More Algorithm!

 

👇👇

 

github.com/ggujangi/ggu.programmers

ggujangi/ggu.programmers

 

 

 

출처 : 프로그래머스