uploaded at 2022. 12. 31. 오후 4:09:38

2022-12-31 16:09:39 +09:00
parent 81a2cd5385
commit c198645c9b
1 changed files with 37 additions and 0 deletions
@@ -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));
+    }
+}