Leetcode Reverse Bits Python

Reverse Bits

Reverse bits of a given the unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represent Ed in binary as00111001011110000010100101000000).

Follow up:
If This function is called many times, what would you optimize it?

Python code:

From string import atoi
Class Solution:
# @param n, an integer
# @return An integer
def reversebits (self, N):
N_str=bin (n) [2:].zfill (+) [ -1::-1] #利用bin内建函数将n转换为二进制字符串, delete the prefix 0b using a slice, expand it to 32 bits, and then reverse
N_int=string.atoi (n_str,2) #将翻转后的二进制字符串转换为整形
Return N_int

Leetcode Reverse Bits Python