1720. Decode XORed Array
Description
There is a hidden integer array arr
that consists of n
non-negative integers.
It was encoded into another integer array encoded
of length n - 1
, such that encoded[i] = arr[i] XOR arr[i + 1]
. For example, if arr = [1,0,2,1]
, then encoded = [1,2,3]
.
You are given the encoded
array. You are also given an integer first
, that is the first element of arr
, i.e. arr[0]
.
Return the original array arr
. It can be proved that the answer exists and is unique.
Example 1:
Input: encoded = [1,2,3], first = 1 Output: [1,0,2,1] Explanation: If arr = [1,0,2,1], then first = 1 and encoded = [1 XOR 0, 0 XOR 2, 2 XOR 1] = [1,2,3]
Example 2:
Input: encoded = [6,2,7,3], first = 4 Output: [4,2,0,7,4]
Constraints:
2 <= n <= 104
encoded.length == n - 1
0 <= encoded[i] <= 105
0 <= first <= 105
Solutions
Solution 1: Bit Manipulation
Based on the problem description, we have:
$$ \textit{encoded}[i] = \textit{arr}[i] \oplus \textit{arr}[i + 1] $$
If we XOR both sides of the equation with $\textit{arr}[i]$, we get:
$$ \textit{arr}[i] \oplus \textit{arr}[i] \oplus \textit{arr}[i + 1] = \textit{arr}[i] \oplus \textit{encoded}[i] $$
Which simplifies to:
$$ \textit{arr}[i + 1] = \textit{arr}[i] \oplus \textit{encoded}[i] $$
Following the derivation above, we can start with $\textit{first}$ and sequentially calculate every element of the array $\textit{arr}$.
The time complexity is $O(n)$, and the space complexity is $O(n)$, where $n$ is the length of the array.
1 2 3 4 5 6 |
|
1 2 3 4 5 6 7 8 9 10 11 |
|
1 2 3 4 5 6 7 8 9 10 |
|
1 2 3 4 5 6 7 |
|
1 2 3 4 5 6 7 |
|