Simple bit manipulation | O(n)
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        for(int i=0;i<n;i++){\n            if(nums[i]==2){\n                ans.push_back(-1);\n            }\n            else{\n                int cnt=0;\n                //cout<<nums[i];\n                int em=nums[i];\n                while(nums[i]>0 &&nums[i]%2==1){\n                    nums[i]/=2;\n                    cnt++;\n                }\n                cnt--;\n                //cout<<" "<<cnt<<" "<<(1<<cnt)<<endl;\n                ans.push_back(em- (1<<cnt));\n            }\n        }\n        return ans;\n    }\n};\n```
['C++']