From 4b49df73d30fce678626f24e7be98e88f5b9ec91 Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Wed, 21 Dec 2022 23:00:53 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202022.=2012.=2021.=20=EC=98=A4?=
 =?UTF-8?q?=ED=9B=84=2011:00:52?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 programmers/N개의 최소공배수/solution.java | 28 ++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 programmers/N개의 최소공배수/solution.java

diff --git a/programmers/N개의 최소공배수/solution.java b/programmers/N개의 최소공배수/solution.java
new file mode 100644
index 0000000..f26426c
--- /dev/null
+++ b/programmers/N개의 최소공배수/solution.java	
@@ -0,0 +1,28 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/12953
+
+import java.util.Arrays;
+class Solution {
+    private int lcm(int a, int b){
+        return a*b/gcd(a,b);
+    }
+    private int gcd(int a, int b){
+        int ans = 0;
+        for(int c = 1; c <= Math.min(a,b); c++){
+            if(a%c==0 && b%c==0) ans = c;
+        }
+        return ans;
+    }
+    public int solution(int[] arr) {
+        int f = arr[0];
+        Arrays.sort(arr);
+        if(arr.length>0)
+        f = lcm(arr[0],arr[1]);
+        System.out.println(f);
+        if(arr.length>1)
+        for(int d = 2; d < arr.length; d++){
+            f = lcm(f,arr[d]);
+            System.out.println(f);
+        }
+        return f;
+    }
+}
\ No newline at end of file