LeetCode OJ Reverse Bits

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

Nightonke

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

阅读量420

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/u012925008/article/details/44513631

版权

leetcode 专栏收录该内容

219 篇文章 0 订阅

订阅专栏

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as00000010100101000001111010011100), 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.

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        uint32_t ans = 0;
<span style="white-space:pre">	</span>for (int i = 0; i < 31; i++) {
		ans |= (n & 1);
		ans <<= 1;
		n >>= 1;
	}
	return ans | (n & 1);
    }
};