문제
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
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.