c++(0ms) only bit manipulations
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```cpp []\nclass Solution {\npublic:\n  vector<int> minBitwiseArray(vector<int>& nums) {\n    vector<int> ans(nums.size());\n\n    for(int i = 0; i != nums.size(); i++){\n      long n = nums[i], x = 1;\n      ans[i] = -1;\n      while(x <= n) x <<= 1;\n      \n      long mask = (x >>= 1);\n      for(; x; x >>= 1)\n        if( (x & n) ){\n          mask |= x;\n          if( (mask | (mask -1)) == n){\n            ans[i] = mask - 1;\n            break;\n          } \n        }    \n    }\n\n    return ans;      \n  }\n};\n```
['C++']