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?
翻转无符号整形的比特位,可以先判断整数中1的位置,进行相应的移位。C++代码如下:
class Solution {
public:
uint32_t reverseBits(uint32_t n) {
uint32_t reverse = 0;
uint32_t bit = 1;
uint32_t temp = 1;
for (int i = 0; i < 32; i++)
{
if ((n & temp) != 0)
{
reverse |= (bit << (31 - i));
cout << "bit: " << bit << endl;
}
temp = temp << 1;
}
return reverse;
}
};