[LeetCode] Reverse Bits 位操作

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as00111001011110000010100101000000).

Follow up:
If this function is called many times, how would you optimize it?

Related problem: Reverse Integer

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Hide Tags

Bit Manipulation

　　遍历输入数的位，输出数反向添加，循环时候需要注意先移位后修改，反过来会错的。

#include<iostream>

using namespace std;

class Solution {

public:

    uint32_t reverseBits(uint32_t n) {

        uint32_t m=;

        for(int i=;i<;i++){

            m<<=;

            m = m|(n & );

            n>>=;

        }

        return m;

    }

};

int main()

{

    uint32_t n = ;

    Solution sol;

    cout<<sol.reverseBits(n)<<endl;

    return ;

}

巴特西

[LeetCode] Reverse Bits 位操作

最新文章

热门文章