Merge pull request #2003 from CodingTestStudy2/최민지

[최민지] Day10

Author: github-actions[bot]

leetcode3/최민지/3314.py

@@ -0,0 +1,15 @@
+class Solution:
+    def minBitwiseArray(self, nums: List[int]) -> List[int]:
+        ans = []
+        for n in nums:
+            if n % 2 == 0:
+                ans.append(-1)
+            else: 
+                # 10  || 01 = 11 
+                # 100 || 101 = 101
+                # 110 || 111 = 111
+                for x in range(n):
+                    if (x | (x+1)) == n:
+                        ans.append(x)
+                        break
+        return ans