From d53eba64799cb7d7da23bee7b54bc0056ac516dd Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Sat, 17 Dec 2022 05:09:33 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202022.=2012.=2017.=20=EC=98=A4?=
 =?UTF-8?q?=EC=A0=84=205:09:32?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 programmers/[1차] 비밀지도/solution.java | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 programmers/[1차] 비밀지도/solution.java

diff --git a/programmers/[1차] 비밀지도/solution.java b/programmers/[1차] 비밀지도/solution.java
new file mode 100644
index 0000000..61fcf73
--- /dev/null
+++ b/programmers/[1차] 비밀지도/solution.java	
@@ -0,0 +1,24 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/17681?language=java
+
+import java.lang.StringBuilder;
+class Solution {
+    public String[] solution(int n, int[] arr1, int[] arr2) {
+        String[] answer = new String[n];
+        StringBuilder sb = new StringBuilder();
+        for(int a = 0; a < n; a++){
+            int org1 = arr1[a];
+            int org2 = arr2[a];
+            for(int b = n-1; b >= 0; b--){
+                if(org1/(int)Math.pow(2,b) + org2/(int)Math.pow(2,b) > 0){
+                    org1 -= (org1/(int)Math.pow(2,b) > 0) ? (int)Math.pow(2,b) : 0;
+                    org2 -= (org2/(int)Math.pow(2,b) > 0) ? (int)Math.pow(2,b) : 0;
+                    sb.append("#");   
+                } 
+                else sb.append(" ");
+            }
+            answer[a] = sb.toString();
+            sb.setLength(0);
+        }
+        return answer;
+    }
+}
\ No newline at end of file