LeetCode [190] Reverse Bits

Questions¶

Difficulty: Easy

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?

Coding¶

python¶

# -*- coding: utf-8 -*-

class Solution(object):
    def reverseBits(self, n):
        """
        :type n: int
        :rtype: int
        """
        b = bin(n)[2:]
        s = b.zfill(32)
        r = int(s[::-1], 2)
        return r