leetcode 190. Reverse Bits 位操作 python3

一.问题描述

Reverse bits of a given 32 bits unsigned integer.

 

Example 1:

Input: 00000010100101000001111010011100
Output: 00111001011110000010100101000000
Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000.

Example 2:

Input: 11111111111111111111111111111101
Output: 10111111111111111111111111111111
Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10111111111111111111111111111111.

 

Note:

• Note that in some languages such as Java, there is no unsigned integer type. In this case, both input and output will be given as signed integer type and should not affect your implementation, as the internal binary representation of the integer is the same whether it is signed or unsigned.
• In Java, the compiler represents the signed integers using 2's complement notation. Therefore, in Example 2 above the input represents the signed integer -3 and the output represents the signed integer -1073741825.

 

Follow up:

If this function is called many times, how would you optimize it?

二.解题思路

方法一：字符串翻转

就是变成二进制字符串，然后反转字符串，再从字符串转为十进制的数字。

变为二进制字符串的时候要填充０使它满足３２位无符号整型。

方法二：位操作

其实也是翻转，通过与操作获得每一位的值（０或者１），然后将这个值通过异或操作赋值到翻转后的位置。

或者ｓｗａｐ，交换相应位置的值。

关于follow up,如果函数运行很多次，那就建表。

比如如果３２位里面，如果第一个位置有个１，那么它相应的翻转位置的数应该是2^31，第二个位置有１，那么翻转位置的数应该是2^30。一个个查表就好了。

这样子节省了位移操作。

更多leetcode算法题解法: 专栏 leetcode算法从零到结束  或者 leetcode 解题目录 Python3 一步一步持续更新～

三.源码

１．字符串翻转

# simple version
class Solution:
    def reverseBits(self, n: int) -> int:
        bin_int=bin(n)
        bin_int=bin_int[2:]
        bin_int='0'*(32-len(bin_int))+bin_int
        return int(bin_in

# one line version
class Solution:
    def reverseBits(self, n: int) -> int:
        return int(bin(n).split("0b")[-1].zfill(32)[::-1],2)

2.位操作

# shift
class Solution:
    def reverseBits(self, n: int) -> int:
        res,t=0,1
        for i in range(1,33):
            res|=(t&n!=0)<<(32-i)
            t<<=1
        return res

# swap
class Solution:
    def reverseBits(self, n: int) -> int:
        res,left,right=0,1,2**31
        for i in range(16):
            res|=(left&n)<<(32-2*i-1)
            res|=(right&n)>>(32-2*i-1)
            left<<=1
            right>>=1
        return res