From c198645c9b993ba0eef858485ad78c3a1653aff7 Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Sat, 31 Dec 2022 16:09:39 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202022.=2012.=2031.=20=EC=98=A4?=
 =?UTF-8?q?=ED=9B=84=204:09:38?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 programmers/숫자 카드 나누기/solution.java | 37 ++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 programmers/숫자 카드 나누기/solution.java

diff --git a/programmers/숫자 카드 나누기/solution.java b/programmers/숫자 카드 나누기/solution.java
new file mode 100644
index 0000000..192654b
--- /dev/null
+++ b/programmers/숫자 카드 나누기/solution.java	
@@ -0,0 +1,37 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/135807
+
+import java.util.*;
+class Solution {
+    private int cdd(int[] ar, int[] arrayB){
+        PriorityQueue<Integer> pq = new PriorityQueue<>();
+        for(int a : ar) pq.add(a);
+        int end = pq.peek(), answer = 0;
+        pq.clear();
+        for(int b = end; b >= 2; b--){
+            boolean all = true;
+            for(int a : ar){
+                if(a%b!=0) {
+                    all = false;
+                    break;
+                }
+            }
+            if(all) {
+                boolean ball = true;
+                for(int c : arrayB){
+                    if(c%b==0){
+                        ball = false;
+                        break;
+                    }
+                }
+                if(ball){
+                    answer = b;
+                    break;
+                }
+            }
+        }
+        return answer;
+    }
+    public int solution(int[] arrayA, int[] arrayB) {
+        return Math.max(cdd(arrayA,arrayB),cdd(arrayB,arrayA));
+    }
+}
\ No newline at end of file