Leetcode-Reverse Bits
2015-05-11 18:14
375 查看
No.2二进制的移位思想
public class Solution {
public int reverseBits(int n) {
int count = 0;
for(int i=0; i<32; i++) {
count = 2*count + (n & 1);
n = n>>>1;
}
return count;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode--Reverse Bits
- leetcode-Reverse Bits
- Leetcode 190 Reverse Bits
- LeetCode190——Reverse Bits
- Leetcode NO.190 Reverse Bits
- [Leetcode]-Reverse Bits
- leetcode 190. Reverse Bits
- LeetCode 190 :Reverse Bits
- LeetCode Reverse Bits
- Leetcode 190 Reverse Bits
- [LeetCode] Reverse Bits
- LeetCode（47）-Reverse Bits
- 【LeetCode】Reverse Bits 翻转二进制
- Leetcode-190 Reverse Bits
- leetcode:Reverse Bits
- LeetCode（47）-Reverse Bits
- 【LEETCODE】190-Reverse Bits
- LeetCode-Reverse Bits
- [Leetcode 190, Easy] Reverse Bits
- [LeetCode]Reverse Bits