Package g1701_1800.s1734_decode_xored_permutation

Class Solution

java.lang.Object

g1701_1800.s1734_decode_xored_permutation.Solution

public class Solution
extends Object

1734 - Decode XORed Permutation.<p>Medium</p> <p>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 <strong>odd</strong>.</p> <p>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>.</p> <p>Given the <code>encoded</code> array, return <em>the original array</em> <code>perm</code>. It is guaranteed that the answer exists and is unique.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> encoded = [3,1]</p> <p><strong>Output:</strong> [1,2,3]</p> <p><strong>Explanation:</strong> If perm = [1,2,3], then encoded = [1 XOR 2,2 XOR 3] = [3,1]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> encoded = [6,5,4,6]</p> <p><strong>Output:</strong> [2,4,1,5,3]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>3 <= n < 10⁵</code></li> <li><code>n</code> is odd.</li> <li><code>encoded.length == n - 1</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	decode(int[] encoded)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

decode

public int[] decode(int[] encoded)