[LeetCode]190. Reverse Bits

题目描述

思路

类似循环移位的思路
位操作

代码

#include <iostream>using namespace std;class Solution {public:    uint32_t reverseBits(uint32_t n) {        uint32_t res = 0;        for (int i = 1; i <= 32; ++i) {            uint32_t temp = n << 31;            n >>= 1;            res = res | (temp >> (i - 1));        }        return res;    }};int main() {    Solution s;    cout << s.reverseBits(1) << endl;    system("pause");    return 0;}