LeetCode 2433. Find The Original Array of Prefix Xor

Algorithm

LeetCode 2433. Find The Original Array of Prefix Xor

쿠케캬캬 2023. 10. 31. 19:58

https://leetcode.com/problems/find-the-original-array-of-prefix-xor/description/

Find The Original Array of Prefix Xor - LeetCode

Can you solve this real interview question? 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 b

leetcode.com

pref를 순회하며 arr[i - 1]까지 xor된 연산 결과를 기억해주고,

해당 연산 결과와 pref[i]를 xor 연산하면, arr[i]를 구할 수 있습니다.

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