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

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        bitset<32> bis(n);
        //cout << bis[1] << endl;
        bitset<32> bis1;
        int j = 0;
        for (int i = 31;i >= 0;i--)
        {
            bis1[j]= bis[i];
            j++;
        }
                
        return bis1.to_ulong();
    }
};