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?

Related problem: Reverse Integer

这道题主要使用位运算，注意 >>右移位，<<左移位 优先级都很低，&也不高，运算时候，加上括号为佳。

获取正数二进制最后一位使用n&1；

此题目代码实现如下：

	public static int reverseBits(int n) {
		int res = 0;
		for (int i = 0; i < 32; i++) {
			res = (res<<1)+(n&1);
			n =n>>1;
		}
		return res;
	}