Reverse Bits

最新推荐文章于 2021-07-23 09:42:30 发布

WhiteJunior

最新推荐文章于 2021-07-23 09:42:30 发布

阅读量146

点赞数 1

分类专栏： C++OJ LeetCode TopInterview Question LeetCode Self-Culture Top Interview Questions

本文链接：https://blog.csdn.net/lym940928/article/details/90552966

版权

Self-Culture 同时被 3 个专栏收录

751 篇文章 4 订阅

订阅专栏

C++OJ

406 篇文章 0 订阅

订阅专栏

LeetCode

406 篇文章 0 订阅

订阅专栏

1，题目要求

Reverse bits of a given 32 bits unsigned integer.

Example 1:
Input: 00000010100101000001111010011100
Output: 00111001011110000010100101000000
Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000.

Example 2:
Input: 11111111111111111111111111111101
Output: 10111111111111111111111111111111
Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10101111110010110010011101101001.

Note:

Note that in some languages such as Java, there is no unsigned integer type. In this case, both input and output will be given as signed integer type and should not affect your implementation, as the internal binary representation of the integer is the same whether it is signed or unsigned.
In Java, the compiler represents the signed integers using 2’s complement notation. Therefore, in Example 2 above the input represents the signed integer -3 and the output represents the signed integer -1073741825.

给定32位无符号整数的反转位。

2，题目思路

对于这道题，要求逆转一个二进制形式的数字。

需要注意的是，int或long是无法存储32位二进制数字的，因此，需要uint32_t的形式来实现。

在实现上比较简单，通过每次增大res（左移操作），并让n进行右移且和1进行&操作获得每一位，完成逆转。

3，代码实现

int x = []() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    return 0;
}();

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        uint32_t res = 0;
        for(int i = 0;i < 32;i++)
            res = (res<<1) + (n>>i & 1);
        return res;
    }
};