题目:
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
Tags Bit Manipulation
Similar Problems (E) Number of 1 Bits
分析:
无
代码:
class Solution {
public:
uint32_t reverseBits(uint32_t n) {
uint32_t m=0;
for(int i=0;i<32;i++)
{
m=m*2+n%2;
n=n/2;
}
return m;
}
};
结果:
总结:
无