190. Reverse Bits
来源：互联网 发布：java parseint方法 编辑：程序博客网 时间：2024/06/16 17:33
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): li = [0] * 32 count = 0 num = 0 while(n!=0): li[31-count] = n%2 n = n//2 count+=1 li.reverse() for i in range(32): num += pow(2,31-i) * li[i] return num
阅读全文
0 0
- 【LeetCode】190.Reverse bits
- LeetCode 190. Reverse Bits
- 190. Reverse Bits
- Leetcode 190. Reverse Bits
- 190. Reverse Bits LeetCode
- 190. Reverse Bits
- 190. Reverse Bits
- 190. Reverse Bits
- LeetCode *** 190. Reverse Bits
- 190. Reverse Bits
- 190. Reverse Bits
- LeetCode 190. Reverse Bits
- 190. Reverse Bits
- 190. Reverse Bits
- Leetcode-190. Reverse Bits
- Leetcode 190. Reverse Bits
- LeetCode-190.Reverse Bits
- [leetcode] 190. Reverse Bits
- nginx正向代理，反向代理，透明代理(总结)
- C#事件
- 4756: [Usaco2017 Jan]Promotion Counting 线段树合并
- 读Zepto源码之Ajax模块
- Django-深度分析Django基于类的视图(3)（翻译）
- 190. Reverse Bits
- [置顶] 融云RongIMKit即时通讯开发(让我们聊起来)
- C++实现一维快速傅里叶变换(FFT)
- 通俗易懂看AVL树
- 论文阅读——Generic and Scalable Framework for Automated Time-series Anomaly Detection
- 转置(.T或者transpose)与轴对换(transpose)
- csdn如何转载别人的文章
- 工作两年总结
- 初学java
