[Leetcode]190. Reverse Bits

最新推荐文章于 2024-05-08 17:39:49 发布

原创最新推荐文章于 2024-05-08 17:39:49 发布 · 283 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

116 篇文章

订阅专栏

本文介绍了一种高效实现32位无符号整数位反转的方法。通过循环迭代，每次将输入整数的最低位转移到结果变量的最高位，实现了位的反转。该方法适用于需要频繁进行位反转操作的应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) {
        uint32_t value = 0;
        for (int i = 0; i != 32; ++i)
            value = (value << 1) | ((n >> i) & 1);
        return value;
    }
};