leetcode 190

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

按位翻转输入的整数。

代码如下：

 class Solution {

 public:

     uint32_t reverseBits(uint32_t n) {

         unsigned ret = ;

         unsigned pos1 =  << ;

         unsigned pos2 = ;

         while(pos1)

         {

             if(pos1 & n)

                 ret |= pos2;

             pos2 <<= ;

             pos1 >>= ;

         }

         return ret;

     }

 };