describe

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, 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]	
Copy the code

Example 2:

Input: encoded = [6,2,7,3], first = 4
Output: [4,2,0,7,4]
Copy the code

Note:

2 <= n <= 104
encoded.length == n - 1
0 <= encoded[i] <= 105
0 <= first <= 105
Copy the code

parsing

Given that arr[0] is first, you only need to use it as the first element of the RES, and then xor each of the encoded elements with the last element of the RES. Append the xOR value to res to get the result.

answer

class Solution(object):
    def decode(self, encoded, first):
        """
        :type encoded: List[int]
        :type first: int
        :rtype: List[int]
        """
        res = [first]
        for i in encoded:
            res.append(i^res[-1])
        return res
        
        	      
		
Copy the code

The results

Given in the Python online submission to Decode XORed Array. Memory Usage: 10000 ms Submissions in Python online submissions for Decode XORed Array.Copy the code

Original link: leetcode.com/problems/de…

Your support is my biggest motivation