LeetCode:Reverse Bits
来源:互联网 发布:数据结构算法题 编辑:程序博客网 时间:2024/06/05 10:06
Total Accepted: 43722 Total Submissions: 150010 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 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
思路:
1.假设只有8位,n=0000 1101,要转化成ret=10110000;
2.首先ret=00000000;
3.判断n的最后一位是0还是1,int b=n&1,n>>=1;
4.ret = ret | b,最后一位放到ret的最后一位,ret<<=1;
5.if(i--<8)转3;(这里i初值为8);
code:
class Solution {public: uint32_t reverseBits(uint32_t n) { int ret=0; int i=32; while(i--) { ret<<=1;// 这里ret先移位,再赋值,因为当n取得最高位的时候,ret不需要再移位 ret |= n&1; n>>=1; } return ret; }};
0 0
- leetCode #190 reverse bits
- 【LeetCode】Reverse Bits
- LeetCode:Reverse Bits
- LeetCode: Reverse Bits
- LeetCode: Reverse Bits
- [LeetCode]Reverse Bits
- leetcode: Reverse Bits
- LeetCode 190 Reverse Bits
- [LeetCode] Reverse Bits
- Leetcode--Reverse Bits
- [leetcode]Reverse Bits
- [LeetCode][190][Reverse Bits]
- #leetcode#Reverse Bits
- LeetCode Reverse Bits
- LeetCode OJ Reverse Bits
- LeetCode(190) Reverse Bits
- [LeetCode 190]Reverse Bits
- LeetCode #190 Reverse Bits
- web.xml详细介绍
- Android 图片和文字布局,RadioButton有些地方比GridView好用些吧
- oracle 数据恢复
- Java Collection
- android网络编程之——客户端上传信息的代码
- LeetCode:Reverse Bits
- ios 中 set get 方法 便利构造器的创建 Block 动画
- POJ 2392 Space Elevator
- C#关键字的使用(params、explicit、implicit、operator)
- Android系统容量检测 —— Environment 和StatFs
- [LeetCode] 3Sum
- 平台无关性与语言无关性
- myeclipse 8.5 struts2 搭建成功后,相关问题。
- Factorial Trailing Zeroes