leetcode : reverse Bits

最新推荐文章于 2021-05-12 12:33:43 发布

二姐不想去实验室

最新推荐文章于 2021-05-12 12:33:43 发布

阅读量336

点赞数

分类专栏： leetcode编程文章标签： leetcode reverseBits

本文链接：https://blog.csdn.net/moli152_/article/details/44999269

版权

leetcode编程专栏收录该内容

25 篇文章 0 订阅

订阅专栏

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

------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

code:

unsigned reverseBits(unsigned int n) {
	unsigned m = 0;
	for (int i = 0; i<32; i++)
	{
		m = m << 1; //m左移
		m = m | (n & 1); // m加上末位数
		n = n >> 1; // n右移
	}
	return m;
}

eg: n = 1101时：

n: 1101—>0110—>0011—>0001—>0000
m: (0000—>0001)—>(0010—>0010)—>(0100 —>0101)—> (1010—>1011)