C++, Easy and Optimized Using Bitwise Operator
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```cpp []\nclass Solution {\npublic:\n    vector<int> minBitwiseArray(vector<int>& nums) {\n        int n = nums.size();\n        vector<int>ans;\n\n        for(int i = 0;i<n;i++){\n            if(nums[i]==2){\n                ans.push_back(-1);\n                continue;\n            } \n            int temp = 1;\n\n            while(nums[i] & temp){\n                temp = temp<<1;\n            }\n\n            temp = temp>>1;\n            nums[i] = nums[i] & (~temp);\n            ans.push_back(nums[i]);\n\n        }\n\n        return ans;\n    }\n};\n```
['C++']