No.2二进制的移位思想
public class Solution {
public int reverseBits(int n) {
int count = 0;
for(int i=0; i<32; i++) {
count = 2*count + (n & 1);
n = n>>>1;
}
return count;
}
}
No.2二进制的移位思想
public class Solution {
public int reverseBits(int n) {
int count = 0;
for(int i=0; i<32; i++) {
count = 2*count + (n & 1);
n = n>>>1;
}
return count;
}
}