From e140fb6b71aa6590e59f6c698e605b289a5b688b 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: Thu, 10 Sep 2026 22:25:45 +0900
Subject: [PATCH] Create 3314. Construct the Minimum Bitwise Array I.java

---
 ...onstruct the Minimum Bitwise Array I.java" | 20 +++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 "leetcode3/\354\227\274\355\230\234\354\240\225/3314. Construct the Minimum Bitwise Array I.java"

diff --git "a/leetcode3/\354\227\274\355\230\234\354\240\225/3314. Construct the Minimum Bitwise Array I.java" "b/leetcode3/\354\227\274\355\230\234\354\240\225/3314. Construct the Minimum Bitwise Array I.java"
new file mode 100644
index 00000000..b101516b
--- /dev/null
+++ "b/leetcode3/\354\227\274\355\230\234\354\240\225/3314. Construct the Minimum Bitwise Array I.java"	
@@ -0,0 +1,20 @@
+// O(n)
+
+class Solution {
+    public int[] minBitwiseArray(List<Integer> nums) {
+        int[] result = new int[nums.size()];
+        for (int i = 0; i<nums.size(); i++) {
+            int num = nums.get(i);
+            if (num == 2) result[i] = -1;
+            else {
+                for (int k = 1; k<32; k++) {
+                    if (((num >> k) & 1) == 0) {
+                        result[i] = num ^ (1 << (k-1));
+                        break;
+                    }
+                }
+            }
+        }
+        return result;
+    }
+}