leetcode 190. 颠倒二进制位 easy
题目描述:
解题思路:
逐位颠倒
代码:
//
class Solution {
public:
uint32_t reverseBits(uint32_t n) {
uint32_t res = 0;
for (int i = 0; i < 32; i++){
res <<= 1;
res += n&1;
n >>= 1;
}
return res;
}
};