LeetCode#190 Reverse Bits

Problem Definition:

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).

Solution : (very Python)

1 def reverseBits(n):
2     return int(((bin(n)[2:]).rjust(32,‘0‘)[::-1]),2)

It can be expanded to:

1 def reverseBits(self,n):
2     s=bin(n)[2:]
3     s=s.rjust(32,‘0‘)
4     s=s[::-1]
5     return int(s,2)

LeetCode#190 Reverse Bits

原文：http://www.cnblogs.com/acetseng/p/4656897.html