[leetcode 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 as00111001011110000010100101000000).

Follow up:
If this function is called many times, how would you optimize it?

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        int temp = 0;
        uint32_t result;
        for(int i=0;i<32;i++)
        {
            temp = n & 1;
            n = n>>1;
            result = (result<<1)|(temp); //<span style="font-family: 'Helvetica Neue', Helvetica, Arial, sans-serif;">result = (result*2)+(temp);</span>
        }
        return result;
        
    }
};