Find The Original Array of Prefix Xor
You are given an integer array pref of size n. Find and return the array arr of size n that satisfies:
pref[i] = arr[0] ^ arr[1] ^ ... ^ arr[i]
Note that ^ denotes the bitwise-xor operation.
It can be proven that the answer is unique.
Example 1
Input
pref = [5,2,0,3,1]Output
[5,7,2,3,2]From the array [5, 7, 2, 3, 2], the prefix xor values are 5, 2, 0, 3, and 1 respectively.
Example 2
Input
pref = [13]Output
[13]We have pref[0] = arr[0] = 13.
Constraints
- 1 <= pref.length <= 10^5
- 0 <= pref[i] <= 10^6