190. Reverse Bits（leetcode）

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

 1 class Solution {
 2 public:
 3     uint32_t reverseBits(uint32_t n) {
 4         bitset<32> bis(n);
 5         //cout << bis[1] << endl;
 6         bitset<32> bis1;
 7         int j = 0;
 8         for (int i = 31;i >= 0;i--)
 9         {
10             bis1[j]= bis[i];
11             j++;
12         }
13                 
14         return bis1.to_ulong();
15     }
16 };