190. Reverse Bits

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as
00111001011110000010100101000000).

Follow up:

If this function is called many times, how would you optimize it?

Related problem:
Reverse Integer

Credits:

Special thanks to
@ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

class Solution {
public:
uint32_t reverseBits(uint32_t n) {
bitset<32> b1;
int i=32;
while(i>0)
{
b1[i-1]=n&1;
n=n>>1;
i--;
}
return b1.to_ulong();
}
};