Simple Java 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```java []\nclass Solution {\n    public int[] minBitwiseArray(List<Integer> nums) {\n        \n        int []ans=new int[nums.size()];\n\n        for(int i=0;i<nums.size();i++){\n            if(nums.get(i)==2)ans[i]=-1;\n            else{\n                int x=nums.get(i);\n                int p=Integer.lowestOneBit(x+1);\n                x=x-(p>>1);\n                ans[i]=x;\n            }\n        }\n\n        return ans;\n    }\n}\n```
['Java']