Problème
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.
Contraintes
1 ≤ width ≤ 63
0 ≤ n < 2^width
Exemples
Entrée :
n = 6
width = 8
Sortie attendue :
expected = 96
Entrée :
long long n = 6;
long long width = 8;
Sortie attendue :
long long expected = 96;
Entrée :
long n = 6;
long width = 8;
Sortie attendue :
long expected = 96;
Explication
6 is 00000110 in 8 bits; reversed it is 01100000, which is 96.
Entrée :
n = 1
width = 3
Sortie attendue :
expected = 4
Entrée :
long long n = 1;
long long width = 3;
Sortie attendue :
long long expected = 4;
Entrée :
long n = 1;
long width = 3;
Sortie attendue :
long expected = 4;
Explication
1 is 001; reversed it is 100, which is 4.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Repeat width times: take the lowest bit of n, then shift n right.
Indice 2
Shift the result left by one before adding the bit you just took.
Indice 3
Leading zeros of n become trailing zeros of the result, which the fixed loop count handles.
Complexité attendue
O(width) time, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.