LeetCode190—Reverse Bits
2017-01-18 17:22
225 查看
原题
https://leetcode.com/problems/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).
分析
主要是位操作，就是把原来的数按位从右到左取出来，往新数上加即可。class Solution {
public:
uint32_t reverseBits(uint32_t n) {
uint32_t res=0;
for(int i=0;i<32;++i)
{
if(LeetCode189—Rotate Arrayn&1==1)
{
res<<=1;
res=res+1;
}
else
{
res<<=1;
}
n>>=1;
}
return res;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【LeetCode】190 Reverse Bits
- Leetcode 190 Reverse Bits
- Leetcode 190 Reverse Bits 位运算
- LeetCode 190 :Reverse Bits
- 【LEETCODE】190-Reverse Bits
- leetcode 190 Reverse Bits
- Leetcode190-Reverse Bits
- LeetCode 190 Reverse Bits
- LeetCode190——Reverse Bits
- LeetCode#190 Reverse Bits
- leetcode:190 Reverse Bits－每日编程第三十二题
- LeetCode（190） Reverse Bits
- Leetcode 190 Reverse Bits
- 【LeetCode-190】 Reverse Bits(C++)
- [Leetcode 190, Easy] Reverse Bits
- LeetCode（190） Reverse Bits
- leetcode 190 Reverse Bits
- [leetcode-190]Reverse Bits(C)
- [LeetCode][190][Reverse Bits]
- [leetcode 190] Reverse Bits