Leetcode 190:reverse Bits

Title Description:

Reverse bits of a given the unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represent Ed in binary as00111001011110000010100101000000).

Follow up:
If This function is called many times, what would you optimize it?

Ideas:

The main research bit operation

1.result=0,result=result + the number and 1 to do bits and arithmetic, the numbers do not stop right-shift operation, until the number is 0;

2. Complete the 32-digit number

    uint32_t reversebits (uint32_t N) {        uint32_t result;        int num = 0;        while (n) {            result = result * + (uint32_t) (n&1);            n = n>>1;            num++;        }        while (num<32) {            result = result<<1;            num++;        }        return result;    }

　　

Leetcode 190:reverse Bits