Java, Easy And Optimized solution 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```java []\nclass Solution {\n    public int[] minBitwiseArray(List<Integer> nums) {\n        int[] ans=new int[nums.size()];\n        int n=nums.size();\n        for(int i=0;i<n;i++){\n            int sf=1;\n            int no=nums.get(i);\n            if(no==2){\n                ans[i]=-1;\n                continue;\n            }\n            while((no&sf)!=0){\n                sf=sf<<1;\n            }\n            sf=sf>>1;\n            ans[i]=no&~(sf);\n        }\n        return ans;\n    }\n}\n```
['Java']