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

---
 programmers/3진법 뒤집기/solution.java | 34 ++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 programmers/3진법 뒤집기/solution.java

diff --git a/programmers/3진법 뒤집기/solution.java b/programmers/3진법 뒤집기/solution.java
new file mode 100644
index 0000000..10b8a6c
--- /dev/null
+++ b/programmers/3진법 뒤집기/solution.java	
@@ -0,0 +1,34 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/68935
+
+import java.util.Arrays;
+class Solution {
+    private static int[] to3(int n){
+        int sn = 0;
+
+        for(int a = 0; a < n; a++){
+            if((int)Math.pow(3,a)>n) {
+                sn = a-1;
+                break;
+            }
+        }
+        int[] ans = new int[sn+1];
+        int ii = 0;
+        for(int b = sn; b>=0; b--){
+            int mi = n/(int)Math.pow(3,b);
+            if(mi>0) {
+                n -= (int)Math.pow(3,b)*mi;
+                 ans[b] = mi;
+            }                
+        }
+        System.out.println(Arrays.toString(ans));
+        return ans;
+    }
+    public int solution(int n) {
+        int answer = 0;
+        int[] arr = to3(n);
+        for(int d = 0; d < arr.length; d++){
+            answer += arr[d]*(int)Math.pow(3,arr.length-d-1);
+        }
+        return answer;
+    }
+}
\ No newline at end of file