LeetCode190——Reverse Bits
2015-04-11 11:10
351 查看
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
题目的意思就是要你把内存里面的二进制数给翻转过来。
难度:简单
实现:
package LeetCodeOJ; class Oj190 { public int reverseBits(int n) { int reverseN = 0; int b; for (int i = 0; i < 32; i++) { b = n&1;//取得n现在的最低位的反 reverseN = (reverseN << 1) + b;//结果左移并把n的最低位的反加上去 n = n >> 1;//n右移一位 } return reverseN; } }
相关文章推荐
- LeetCode(190) Reverse Bits
- leetcode 190 Reverse Bits
- Leetcode 190 Reverse Bits
- 【LeetCode-190】 Reverse Bits(C++)
- [leetcode 190] Reverse Bits
- LeetCode 190 Reverse Bits
- LeetCode190—Reverse Bits
- leetcode 190 Reverse Bits
- [leetcode-190]Reverse Bits(C)
- leetcode-190 reverse bits 位运算
- LeetCode 190 Reverse Bits
- leetcode-Reverse Bits-190
- LeetCode190——Reverse Bits
- [leetcode190]Reverse Bits
- LeetCode 190: Reverse Bits
- leetcode-190-Reverse Bits
- leetcode_190题——Reverse Bits(bitset的使用)
- leetcode 190 Reverse Bits
- 【leetcode 190 Reverse Bits 】
- leetcode 190 Reverse Bits