LeetCode--No.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 as 00111001011110000010100101000000).

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

Related problem: Reverse Integer

我真的还是有点儿崩溃的，一开始怎么试都不通过。后来就抄了别人的答案。。。

对于这种问题，需要谨记，不要试图用数学的方法求出一个整数的二进制的每一位。一定要用移位的办法，很简单的。
bit = n & (1<<i)，

1<<i的意思就是，将1左移i次。移一次变为2，移两次变为4，每移一次相当于乘以2.
而比如说n等于111100000100，1<<4则变为000000001000
求与之后，相当于提取出n的第四位bit值。

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
        int res = 0;
        int bit = 0;
        for(int i = 0; i < 32; i++){
            bit = n & (1<<i);
            if(bit != 0)
                res  = res + (1<<(31-i));
        }
        return res;
    }
}