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 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.

solution:巧妙的移位，先一位一位的取，然后右移，与原先的结果进行或运算，代码短小精悍。

class Solution {
public:

    uint32_t reverseBits(uint32_t n) {
        
        uint32_t result;
        
        for(int i=0;i<32;i++)
        {
            result|=(((n>>i&1)<<(31-i)));
        }
        return result;
    }
};

LeetCode:Reverse Bits

原文：http://www.cnblogs.com/xiaoying1245970347/p/4581608.html