[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

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

 1 class Solution {
 2 public:
 3     uint32_t reverseBits(uint32_t n) {
 4         uint32_t res = 0;
 5         for (int i = 0; i < 32; ++i) {
 6             res |= (((n >> i) & 1) << (31 - i));
 7             
 8         }
 9         return res;
10     }
11 };

如果多次调用的话，我想改成内联函数是不是可以优化一点呢？

[LeetCode] Reverse Bits

原文：http://www.cnblogs.com/easonliu/p/4320902.html