leetcode[190]:Reverse Bits

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

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

uint32_t reverseBits(uint32_t n) {    char final[32];    int i,j;    uint32_t res=0;    for(i=0;i<32;i++)    {         final[i] = (n>>i) & 0x01;    }    for(i=0;i<32;i++)    {        res = res*2+final[i];    }    return res;}

位操作，字符数组，转换成十进制。