2433. 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.

class Solution {
public:
    vector<int> findArray(vector<int>& pref) {
        for(int i = 0, now = 0; i < pref.size(); i++) {
            int n = pref[i] ^ now;
            pref[i] = n;
            now ^= pref[i];
        }
        return pref;
    }
};