Python 3 fast solution
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\n\tdef _xor(self, n: int) -> int:\n\t\tif n&1:\n\t\t\tm = (n>>1) + 1\n\t\t\treturn n - (m&-m)\n\t\telse:\n\t\t\treturn -1\n\n\tdef minBitwiseArray(self, nums: list[int]) -> list[int]:\n\t\treturn map(self._xor, nums)\n\n```
['Bit Manipulation', 'Python3']