LeetCode : Reverse Bits
2017-04-26 15:16
267 查看
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
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 {
public:
uint32_t reverseBits(uint32_t n) {
uint32_t num = 0;
for(int i=0;i<32;++i)
{
num = (num<<1)+(n>>i&1);
}
return num;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode 190]Reverse Bits
- leetcode 190:Reverse Bits
- 【LEETCODE】190-Reverse Bits
- [leetcode] 190. Reverse Bits
- LeetCode:Reverse Bits
- leetcode - Reverse Bits
- 【LeetCode-面试算法经典-Java实现】【190-Reverse Bits（反转二制）】
- [LeetCode]Reverse Bits
- leetcode[190]:Reverse Bits
- LeetCode#190 Reverse Bits
- Leetcode: Reverse Bits
- leetcode---2.Reverse Bits
- leetcode-Reverse Bits-190
- Leetcode: Reverse Bits
- [Leetcode]-Reverse Bits
- LeetCode 190 Reverse Bits
- LeetCode Reverse Bits
- leetcode - 190. Reverse Bits
- (*leetcode_位运算)Reverse Bits
- Leetcode-190 Reverse Bits 数字二进制倒置