Python3 | 0ms | Beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def minBitwiseArray(self, nums: List[int]) -> List[int]:\n        result = []\n\n        for n in nums:\n            if n % 2 == 0:\n                result.append(-1)\n                continue\n\n            i = 0\n            while n & (1 << i) != 0:\n                i += 1\n\n            result.append((1 << (i - 1)) ^ n)\n\n        return result\n```
['Python3']