From 8641af88bc11851fb074594cfb3c22b959047463 Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Sat, 17 Dec 2022 19:12:57 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202022.=2012.=2017.=20=EC=98=A4?=
 =?UTF-8?q?=ED=9B=84=207:12:56?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../최대공약수와 최소공배수/solution.java     | 29 +++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 programmers/최대공약수와 최소공배수/solution.java

diff --git a/programmers/최대공약수와 최소공배수/solution.java b/programmers/최대공약수와 최소공배수/solution.java
new file mode 100644
index 0000000..4fbbc4b
--- /dev/null
+++ b/programmers/최대공약수와 최소공배수/solution.java	
@@ -0,0 +1,29 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/12940
+
+class Solution {
+    public int[] solution(int n, int m) {
+        int[] answer = new int[2];
+        int maxCo = 1;
+        int minCo = 1;
+        for(int a = 1; a <= n; a++){
+            if(n%a==0 && m%a==0) maxCo = a;
+            else if(n/a<2 && m/a<2) break;
+        }
+        int d = 1;
+        int e = 1;
+        while(true){
+            if(Math.max(n,m)*d==Math.min(n,m)*e) {
+                minCo = Math.min(n,m)*e;
+                break;
+            }
+            else if(Math.max(n,m)*d<Math.min(n,m)*e){
+                d++;
+                e = 1;
+            }
+            else e++;
+        }
+        answer[0] = maxCo;
+        answer[1] = minCo;
+        return answer;
+    }
+}
\ No newline at end of file