LeetCode190——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

题目的意思就是要你把内存里面的二进制数给翻转过来。

难度：简单

实现：

package LeetCodeOJ;

class Oj190 {
public int reverseBits(int n) {
  int reverseN = 0;
    int b;
    for (int i = 0; i < 32; i++) {
        b =  n&1;//取得n现在的最低位的反
        reverseN = (reverseN << 1) + b;//结果左移并把n的最低位的反加上去
        n = n >> 1;//n右移一位
    }
    return reverseN;
}
}