【位运算】颠倒二进制位

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