#868 · #1829 · Maximum XOR for Each Query(每个查询的最大异或值)

You are given a sorted array nums of n non-negative integers and an integer maximumBit. Perform n queries: in the i-th query, take the XOR of the first n - i elements and choose the largest k < 2^maximumBit that maximises the XOR with that prefix. Return the answers in order. Constraints: 1 <= nums.length <= 10^5, 1 <= maximumBit <= 20, 0 <= nums[i] < 2^maximumBit.