leetcode 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

代码如下：

uint32_t reverseBits(uint32_t n) {
    uint32_t result=0;
    int flag;
    for(int m=0;m<32;m++)
    {
        flag=n%2;
        result=flag+result*2;
        n=n/2;
    }
    return result;
}

其中的flag运算可以用位运算代替，最后一步也可以省略。