【LeetCode】190.Reverse Bits

最新推荐文章于 2025-09-12 17:31:31 发布

weixin_30614109

最新推荐文章于 2025-09-12 17:31:31 发布

阅读量63

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/jialei-bupt/p/7573729.html

原题地址：https://leetcode.com/problems/reverse-bits/description/

Reverse bits of a given 32 bits unsigned integer.

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

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

想法：考虑到较大数据的时间问题，不能用常规计算二进制的方法，应该用逻辑运算去计算。由于自己对位运算的操作并不是很熟练，所以参考了评论区大神的解法，代码如下：

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        n = (n >> 16) | (n << 16);
        n = ((n & 0xff00ff00) >> 8) | ((n & 0x00ff00ff) << 8);
        n = ((n & 0xf0f0f0f0) >> 4) | ((n & 0x0f0f0f0f) << 4);
        n = ((n & 0xcccccccc) >> 2) | ((n & 0x33333333) << 2);
        n = ((n & 0xaaaaaaaa) >> 1) | ((n & 0x55555555) << 1);
        return n;
    }
};

转载于:https://www.cnblogs.com/jialei-bupt/p/7573729.html