public class Solution {
// you need treat n as an unsigned value
public int reverseBits(int n) {
long result = 0;
for(int i = 31; i >= 0; --i) {
result += (n & 1) * Math.pow(2, i);
n = n >>> 1;
}
return (int)result;
}
}
Reverse Bits
最新推荐文章于 2019-03-06 19:48:40 发布