题目描述:
Reverse bits of a given 32 bits unsigned integer.
Example:
Input: 43261596
Output: 964176192
Explanation: 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,那么在结果中加上对应的低位。
class Solution {
public:
uint32_t reverseBits(uint32_t n) {
uint32_t result=0;
for(int i=0;i<32;i++)
{
if(n%2==1) result=result*2+1;
else result*=2;
n/=2;
}
return result;
}
};