题目:
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?
Related problem: Reverse Integer
分析:
不能直接取反,需要补齐32位,按位运算。
代码如下:
class Solution:
# @param n, an integer
# @return an integer
def reverseBits(self, n):
sumBin = 0
i = 31
while i:
sumBin += n & 1
sumBin <<= 1
n = n >> 1
i -= 1
sumBin += n
return sumBin