Reverse Bits
Reverse the bits of a given 32-bit unsigned integer.
Constraints:
- The input is a 32-bit unsigned integer.
- The output should be a 32-bit unsigned integer.
Examples:
Input: 43261596
Output: 964176192
Explanation: The binary representation of 43261596 is 001010110100010101100110100. Reversing the bits gives 010011011001010100101100100, which is 964176192 in decimal.
Solutions
Bit Manipulation
Time: O(1)Space: O(1)
The solution uses bit manipulation to reverse the bits of the input number. It iterates 32 times, shifting the result to the left by one bit and adding the least significant bit of the input number to the result. The input number is then shifted to the right by one bit. The process is repeated until all bits have been reversed.
function reverseBits(n) {
let result = 0;
for (let i = 0; i < 32; i++) {
result = (result << 1) | (n & 1);
n >>>= 1;
}
return result >>> 0;
}
Follow-up:
How would you optimize the solution for a 64-bit unsigned integer?
