题目:
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?
朴素做法就是按位移。高级做法是以4位为单位预存reverse结果。
C++版:
class Solution {
public:
uint32_t reverseBits(uint32_t n) {
char t[] = {0,8,4,12,2,10,6,14,1,9,5,13,3,11,7,15};
int r = 0;
for(int i = 0; i < 8; i++) {
r = (r << 4) + t[n & 0xF];
n >>= 4;
}
return r;
}
};
Java版:
public class Solution {
// you need treat n as an unsigned value
public int reverseBits(int n) {
char[] t = {0,8,4,12,2,10,6,14,1,9,5,13,3,11,7,15};
int r = 0;
for(int i = 0; i < 8; i++) {
r = (r << 4) + t[n & 0xF];
n >>= 4;
}
return r;
}
}
Python版:
class Solution(object):
def reverseBits(self, n):
"""
:type n: int
:rtype: int
"""
i = 0
m = 0
while i != 32:
m = (m << 1) + (n & 1)
n >>= 1
i += 1
return m