Construct the Minimum Bitwise Array I

You are given an array nums consisting of n prime integers.

You need to construct an array ans of length n, such that, for each index i, the bitwise OR of ans[i] and ans[i] + 1 is equal to nums[i], i.e. ans[i] OR (ans[i] + 1) == nums[i].

Additionally, you must minimize each value of ans[i] in the resulting array.

If it is not possible to find such a value for ans[i] that satisfies the condition, then set ans[i] = -1.

LeetCode Problem - 3314

class Solution {
    public int[] minBitwiseArray(List<Integer> nums) {
        int length = nums.size(); // Get the size of the input list
        int[] answer = new int[length]; // Initialize an array to store the results

        // Iterate through each number in the list
        for (int i = 0; i < length; i++) {
            answer[i] = findBitwiseOR(nums.get(i)); // Compute the result for each number and store it in the answer array
        }
        return answer; // Return the final result array
    }

    // Helper function to find the minimum value `idx` such that `idx | (idx + 1) == target`
    public int findBitwiseOR(int target) {
        int idx = 0; // Initialize idx to start searching from 0

        // Iterate to find the correct `idx`
        while (true) {
            // If the condition `idx | (idx + 1) == target` is met, return `idx`
            if ((idx | (idx + 1)) == target) {
                return idx;
            }

            // If `idx` exceeds `target`, return -1 indicating no valid solution found
            if (idx > target) return -1;

            idx++; // Increment `idx` and try again
        }
    }
}