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).
出处:http://www.programcreek.com/2014/03/leetcode-reverse-bits-java/
public class Solution {
// you need treat n as an unsigned value
public int reverseBits(int n) {
for(int i=0;i<16;i++){
int j=32-1-i;//与i相对称的那个位
if((((n>>i)&1)^((n>>j)&1))==0) ;//(n>>i)&1是对n左移了n位之后与1做与运算,所以保留了第i位(i是从0开始)
//故而如果第i位和第j位的数字相同,则不交换,如果不同,则进行下边的交换操作
else n^=(1<<i)|(1<<j);//走到这一步,证明i和j位已经不同了,故只需把相应位的0变为1,1变为0
//|是按为或的意思,1<<i| 1<<j即构造了一个第i和j位为1的32位数,再与n进行异或(^),即取反。因为0或1与1异或都是取反
}
return n;
}
}
public class Solution {
// you need treat n as an unsigned value
public int reverseBits(int n) {
for(int i=0;i<16;i++){
int low=(n>>i)&1;
int high=(n>>32-1-i)&1;
if((high^low)==1) n^=(1<<i)|(1<<32-1-i);//^异或后边如果要跟==的话记着一定要把异或的俩括起来,不然出错
}
return n;
}
}