[LeetCode] Reverse Bits

转载于 2019-07-20 04:03:10 发布 · 158 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/easonliu/p/4320902.html

本文介绍了一种高效的32位无符号整数位反转算法，并提供了一个具体的C++实现示例。该算法通过循环遍历每一位并进行反转操作来实现目标功能。

摘要生成于 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 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.

 1 class Solution {
 2 public:
 3     uint32_t reverseBits(uint32_t n) {
 4         uint32_t res = 0;
 5         for (int i = 0; i < 32; ++i) {
 6             res |= (((n >> i) & 1) << (31 - i));
 7         }
 8         return res;
 9    }
10 };