[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?

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

[LeetCode] Reverse Bits

原文：http://www.cnblogs.com/vincently/p/4811451.html