题目链接:https://leetcode.com/problems/reverse-bits/
Runtimes:10ms
1、问题
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).
2、分析
比特位操作无外乎运用位移操作进行运算,>>,<<,&,|,^,~。
3、总结
第一,n>>1并没有改变n,这是要注意的;
第二,注意处理条件,比如m判断完之后就不应该再移位了;
第三,注意运算符的优先级顺序,最好用上括号。
4、实现
class Solution {
public:
uint32_t reverseBits(uint32_t n) {
uint32_t m = 0;
for(int i = 0; i < 32; i++)
{
if ((n & 1) == 1)
{
m = m | 1;
}
n = n>>1;
if (i < 31)
m = m << 1;
}
return m;
}
};
5、反思
不错的关于位移的总结文章。
文章链接:http://blog.csdn.net/morewindows/article/details/7354571