From c96c4dc36ba96938855e6e27b3f9c8a327f75f82 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EC=97=BC=ED=98=9C=EC=A0=95?=
 <122238744+cyzlcyzl@users.noreply.github.com>
Date: Mon, 10 Aug 2026 15:04:55 +0900
Subject: [PATCH] Create 476. Number Complement.java

---
 .../476. Number Complement.java"              | 33 +++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 "leetcode3/\354\227\274\355\230\234\354\240\225/476. Number Complement.java"

diff --git "a/leetcode3/\354\227\274\355\230\234\354\240\225/476. Number Complement.java" "b/leetcode3/\354\227\274\355\230\234\354\240\225/476. Number Complement.java"
new file mode 100644
index 00000000..4b47b9ef
--- /dev/null
+++ "b/leetcode3/\354\227\274\355\230\234\354\240\225/476. Number Complement.java"	
@@ -0,0 +1,33 @@
+// 10진수 -> 2진수
+// 1과 0을 서로 바꿈
+// 2진수 -> 10진수
+
+
+class Solution {
+    public int findComplement(int num) {
+        StringBuilder sb = new StringBuilder();
+        while (num>0) {
+            int bit = num%2;
+            // 0과 1을 체인지
+            if (bit == 0) sb.append(1);
+            else sb.append(0);
+            num /= 2;
+        }
+
+        String ten = sb.toString();
+        int result = ten.charAt(0) - '0';
+        if (ten.length() == 1) return result;
+
+        for (int i = 1; i<ten.length(); i++) {
+            int digit = ten.charAt(i) - '0';
+            if (digit == 0) continue;
+            int pow = 1;
+            for (int cnt = 0; cnt<i; cnt++) {
+                pow *= 2;
+            }
+            result += pow;
+        }
+
+        return result;
+    }
+}