LeetCode: 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 as00111001011110000010100101000000).

Follow up:
If this function is called many times, how would you optimize it?

Related problem: Reverse Integer

思路：

此题我想到的可以提高执行效率的方法只有两种：使用或运算来代替最后一位bit的加法；使用左移来代替乘以2，使用右移来代替除以2；使用与运算来代替取一个数最后一个bit。

代码如下：

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        int ret = 0;
        for(int i = 0; i < 32; i++)
        {
            ret <<= 1;
            ret |= (n & 1);
            n >>= 1;
        }
        return ret;
    }
};