【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).

很简单一道题，我调用了java里的Integer.toBinaryString(int n)函数，需要注意的是，该函数返回的二进制串不是足够的32位串，

具体代码如下：

public static int reverseBits(int n) {
String bits = Integer.toBinaryString(n);
int length = bits.length();
int f = 1; //乘法因子
int j = 0;
while(j<32-length){ //不足32位的，也就是最后结果要左移32-length,即乘以2^(32-length)
f = f*2;
j++;
}
int i = 0;
int result = 0;
while(i<length){
int bit = Integer.parseInt(bits.substring(i,i+1));
if(bit==1)
result = result + f;
f = f * 2; //下一位乘法因子为f*2
i++;
}
   return result;
   }