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.
Vincoli
1 ≤ width ≤ 63
0 ≤ n < 2^width
Esempi
Input:
n = 6
width = 8
Output atteso:
expected = 96
Input:
long long n = 6;
long long width = 8;
Output atteso:
long long expected = 96;
Input:
long n = 6;
long width = 8;
Output atteso:
long expected = 96;
Spiegazione
6 is 00000110 in 8 bits; reversed it is 01100000, which is 96.
Input:
n = 1
width = 3
Output atteso:
expected = 4
Input:
long long n = 1;
long long width = 3;
Output atteso:
long long expected = 4;
Input:
long n = 1;
long width = 3;
Output atteso:
long expected = 4;
Spiegazione
1 is 001; reversed it is 100, which is 4.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Repeat width times: take the lowest bit of n, then shift n right.
Suggerimento 2
Shift the result left by one before adding the bit you just took.
Suggerimento 3
Leading zeros of n become trailing zeros of the result, which the fixed loop count handles.
Complessità attesa
O(width) time, O(1) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.