Easy 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        int n = nums.size();\n        \n        int[] ans = new int[n];\n        for(int i=0; i<n; i++){\n            for(int j=0; j<=nums.get(i); j++){\n                if((j|(j+1))==nums.get(i)){\n                    ans[i]=j;\n                    break;\n                }\n            }\n            if(ans[i]==0){\n                ans[i]=-1;\n            }\n        }\n        return ans;\n    }\n}\n```
['Java']