Easy Approach for Beginners 2.0
IntuitionLets develop ideas from https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/solutions/5904063/easy-approach-for-beginners/Thanks to @si
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
Lets develop ideas from https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/solutions/5904063/easy-approach-for-beginners/

Thanks to @siddhuuse (https://leetcode.com/u/siddhuuse/)

In a little clearer way, because flat is better than nested.

# Approach
<!-- Describe your approach to solving the problem. -->
Please don't forget that boolean operators and binary operators in python are different things. And they work differently. "OR" as boolean operator is not the same as binary or "|"



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

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

# Code
```python3 []
from typing import List

class Solution:

    def compare(self, i: int) -> int:
        
        for j in range(i):
            if (j | j+1) == i:
                return j
        return -1

    def minBitwiseArray(self, nums: List[int]) -> List[int]:
        
        ans = []
        for i in nums:
            ans.append(self.compare(i))

        return ans
```
['Python3']