190. Reverse Bits

最新推荐文章于 2024-01-19 11:13:02 发布

weixin_30807779

最新推荐文章于 2024-01-19 11:13:02 发布

阅读量45

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Reindeer/p/5755830.html

本文介绍了一种高效的32位无符号整数二进制位反转算法，通过位运算实现，提供了具体的C++实现代码。

题目：

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?

答案：

就是二进制倒置，用位运算解决

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