Easy Java Solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int[] minBitwiseArray(List<Integer> nums) {
        

        int[] a = new int[nums.size()];

        for(int i=0;i<nums.size();i++){
            int b = 1;
            while(b<nums.get(i)){
                    if((b | (b+1)) == nums.get(i)){
                        a[i]=b;
                        break;
                    }
                    b++;
            }

            if(a[i]<=0) a[i]=-1;
        }
        return a;
    }
}
```
['Java']