JAVA 1ms(100%) with O(N*logV)
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> n) {\n        int[] a = new int[n.size()];\n        for(int i=0; i<a.length; i++){\n            if(n.get(i)==2)a[i]=-1;\n            else a[i]=n.get(i)-find(n.get(i));\n        }\n        return a;\n    }\n    private int find(int x){\n        int y=1;\n        while((x&y)>0)y<<=1;\n        return y>>1;\n    }\n}\n```
['Java']