Reverse Bits

思路：
錯誤點：& 沒有>>/<<優先級高

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?

Related problem: Reverse Integer

class Solution(object):def reverseBits(self, n):""":type n: int:rtype: int"""i = 0j = 31while i<j:if ((n&(1<<i))>>i)!=((n&(1<<j))>>j):n=n^(1<<i)^(1<<j)i+=1j-=1return n

轉載于:https://www.cnblogs.com/absolute/p/5544388.html

總結

以上是生活随笔為你收集整理的边工作边刷题：70天一遍leetcode: day 3的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。