Problema
Write n in binary using exactly width bits, adding leading zeros as needed, then read those bits backwards. For n = 6 and width = 4, 6 is 0110, reversed it is 0110 again, so the result is 6. For width = 8 it is 00000110, reversed 01100000, which is 96. Bit reversal is used in the fast Fourier transform and in some hashing tricks.
Implement reverse_the_bits(n, width).
Input
n: A non-negative integer that fits in width bits.
width: How many bits to reverse.
Output
Return the value of the reversed width-bit pattern.
Restricciones
1 ≤ width ≤ 63
0 ≤ n < 2^width
Ejemplos
Entrada:
n = 6
width = 8
Salida esperada:
expected = 96
Entrada:
long long n = 6;
long long width = 8;
Salida esperada:
long long expected = 96;
Entrada:
long n = 6;
long width = 8;
Salida esperada:
long expected = 96;
Explicación
6 is 00000110 in 8 bits; reversed it is 01100000, which is 96.
Entrada:
n = 1
width = 3
Salida esperada:
expected = 4
Entrada:
long long n = 1;
long long width = 3;
Salida esperada:
long long expected = 4;
Entrada:
long n = 1;
long width = 3;
Salida esperada:
long expected = 4;
Explicación
1 is 001; reversed it is 100, which is 4.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Repeat width times: take the lowest bit of n, then shift n right.
Pista 2
Shift the result left by one before adding the bit you just took.
Pista 3
Leading zeros of n become trailing zeros of the result, which the fixed loop count handles.
Complejidad esperada
O(width) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.