public class Solution {
// you need treat n as an unsigned value
public int reverseBits(int n) {
int rst = 0;
for (int i = 0; i < 32; i++) {
rst += (n & 1);
n >>>= 1;
if (i < 31) rst <<= 1;
}
return rst;
}
}
Follow Up
If this function is called many times, how would you optimize it?