Problema
In a Gray code sequence each value differs from the previous one in exactly one bit. The standard (reflected binary) Gray code of i is i XOR (i >> 1): for 2 bits the sequence is 0, 1, 3, 2, which is 00, 01, 11, 10 in binary. Rotary encoders use it so that a reading taken between two positions is never wildly wrong.
Implement gray_code(n).
Input
n: The number of bits.
Output
Return the 2^n values of the reflected binary Gray code in order, as integers, starting with 0. For n = 0 return [0].
Restricciones
0 ≤ n ≤ 16
Ejemplos
Entrada:
n = 2
Salida esperada:
expected = [0, 1, 3, 2]
Entrada:
long long n = 2;
Salida esperada:
std::vector<long long> expected = {0, 1, 3, 2};
Entrada:
long n = 2;
Salida esperada:
long[] expected = new long[] {0, 1, 3, 2};
Explicación
In binary the sequence is 00, 01, 11, 10, so the answer is [0, 1, 3, 2].
Entrada:
n = 3
Salida esperada:
expected = [0, 1, 3, 2, 6, 7, 5, 4]
Entrada:
long long n = 3;
Salida esperada:
std::vector<long long> expected = {0, 1, 3, 2, 6, 7, 5, 4};
Entrada:
long n = 3;
Salida esperada:
long[] expected = new long[] {0, 1, 3, 2, 6, 7, 5, 4};
Explicación
Each value is i XOR (i >> 1) for i = 0 to 7: [0, 1, 3, 2, 6, 7, 5, 4].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Loop i from 0 to 2^n − 1.
Pista 2
Each Gray code value comes from i and i shifted right by one.
Pista 3
For n = 0 the loop runs once and gives [0].
Complejidad esperada
O(2^n) time, O(2^n) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.