Reverse bits of a given 32 bits unsigned integer.
For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as00111001011110000010100101000000).
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) {
uint32_t res = 0;
int cnt = 32;
while(cnt--) {
int temp = n%2;
res = res*2+temp;
n = n/2;
}
return res;
}
};