Construct the Minimum Bitwise Array II
You receive an array nums consisting of n prime integers.
You need to construct an list 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 list.
If it is not possible to determine such a value for ans[i] that satisfies the condition , then set ans[i] = -1 .
Input: nums = [2,3,5,7]
Output: [-1,1,4,3]
Explanation:
-
For
i = 0, as there is no value forans[0]that satisfiesans[0] OR (ans[0] + 1) = 2, soans[0] = -1. -
For
i = 1, the smallestans[1]that satisfiesans[1] OR (ans[1] + 1) = 3is1, because1 OR (1 + 1) = 3. -
For
i = 2, the smallestans[2]that satisfiesans[2] OR (ans[2] + 1) = 5is4, because4 OR (4 + 1) = 5. -
For
i = 3, the smallestans[3]that satisfiesans[3] OR (ans[3] + 1) = 7is3, because3 OR (3 + 1) = 7.
Input: nums = [11,13,31]
Output: [9,12,15]
Explanation:
-
For
i = 0, the smallestans[0]that satisfiesans[0] OR (ans[0] + 1) = 11is9, because9 OR (9 + 1) = 11. -
For
i = 1, the smallestans[1]that satisfiesans[1] OR (ans[1] + 1) = 13is12, because12 OR (12 + 1) = 13. -
For
i = 2, the smallestans[2]that satisfiesans[2] OR (ans[2] + 1) = 31is15, because15 OR (15 + 1) = 31.
Constraints
1 <= nums.length <= 1002 <= nums[i] <= 10^9nums[i]is a prime number.
Did this problem appear in one of your interviews?
Responses stay private.