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.
Subscribe to see which companies asked this question
就是用最简单直白的一位一位做
class Solution(object):
def reverseBits(self, n):
res = [0]*32
i = 0
while n>0:
res[i]= n&1
n = n >> 1
i += 1
i = 31
r = 0
for j in res:
if j:
r += 1<<i#pow(2,i)
i -= 1
return r
"""
:type n: int
:rtype: int
"""