[LeetCode]--190. Reverse Bits（不是很懂的位运算）

补充知识，Java的位运算（bitwise operators）

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.

public int reverseBits(int n) {
        int reversed = 0;
        for (int