bit manipulation
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: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\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        n=len(nums)\n        ans=[]\n        for i in range(n):\n            mini=float("inf")\n            for j in range(32):\n                temp=nums[i] & ~(1 << (j))\n                if temp |(temp+1)==nums[i]:\n                    mini=min(mini,temp)\n            if mini==float("inf"):\n                mini=-1\n            ans.append(mini)\n        return ans\n        \n```
['Bit Manipulation', 'Python3']