decode-xored-permutation

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

There is an integer array <code>perm</code> that is a permutation of the first <code>n</code> positive integers, where <code>n</code> is always odd.

It was encoded into another integer array <code>encoded</code> of length <code>n - 1</code>, such that <code>encoded[i] = perm[i] XOR perm[i + 1]</code>. For example, if <code>perm = [1,3,2]</code>, then <code>encoded = [2,1]</code>.

Given the <code>encoded</code> array, return the original array <code>perm</code>. It is guaranteed that the answer exists and is unique.

&nbsp;
Example 1:

<pre>
Input: encoded = [3,1]
Output: [1,2,3]
Explanation: If perm = [1,2,3], then encoded = [1 XOR 2,2 XOR 3] = [3,1]
</pre>

Example 2:

<pre>
Input: encoded = [6,5,4,6]
Output: [2,4,1,5,3]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>3 &lt;= n &lt;&nbsp;105</code></li>
	<li><code>n</code>&nbsp;is odd.</li>
	<li><code>encoded.length == n - 1</code></li>
</ul>