【leetcode题解】【E】【59】Reverse Bits

最新推荐文章于 2025-12-05 17:02:52 发布

原创最新推荐文章于 2025-12-05 17:02:52 发布 · 488 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode题解 #python #位操作

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一种方法来反转一个给定的32位无符号整数的所有位，并提供了一个Python实现的例子。例如，输入43261596（二进制为00000010100101000001111010011100），输出964176192（二进制为00111001011110000010100101000000）。讨论了如何优化此过程以提高效率。

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
        """