public class Solution {
// you need treat n as an unsigned value
public int reverseBits(int n) {
if(n == 0) return n;
int i = -1, m = 0;
while(++i <= 31) {
m = m | ((n & 1) << (31-i));
n = n>>1;
}
return m;
}
}
leetcode颠倒二进制位
最新推荐文章于 2024-07-25 13:03:12 发布