問題
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.
制約
1 ≤ width ≤ 63
0 ≤ n < 2^width
例
入力:
n = 6
width = 8
期待される出力:
expected = 96
入力:
long long n = 6;
long long width = 8;
期待される出力:
long long expected = 96;
入力:
long n = 6;
long width = 8;
期待される出力:
long expected = 96;
解説
6 is 00000110 in 8 bits; reversed it is 01100000, which is 96.
入力:
n = 1
width = 3
期待される出力:
expected = 4
入力:
long long n = 1;
long long width = 3;
期待される出力:
long long expected = 4;
入力:
long n = 1;
long width = 3;
期待される出力:
long expected = 4;
解説
1 is 001; reversed it is 100, which is 4.
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Repeat width times: take the lowest bit of n, then shift n right.
ヒント 2
Shift the result left by one before adding the bit you just took.
ヒント 3
Leading zeros of n become trailing zeros of the result, which the fixed loop count handles.
目安の計算量
O(width) time, O(1) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。