LeetCode 第 190 题 (Reverse Bits)

LeetCode 第 190 题 (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).

Follow up:
If this function is called many times, how would you optimize it?

将一个整数按位翻转，题目并不难。最简单的办法就是用个循环遍历各个位，然后将其放置到合适的位置。下面是代码：

uint32_t reverseBits(uint32_t n)
{
    uint32_t ret = 0;
    for(int i = 0; i < 32; i++)
    {
        ret = (ret << 1) + (n & 1);
        n = n >> 1;
    }
    return ret;
}

这里需要注意的是运算符的优先级， “<<” 和 “&” 的优先级都很低，所以要加括号，这个地方很容易出错。

除了这种循环置位方法，还可以用查表法。我们没法将 32 位整数列举一遍，但是可以列举小一点的整数。比如下面程序这样四位四位的处理。

class Solution {
public:
    uint8_t reverseChar(uint8_t c)
    {
        const uint8_t table[16] = {0x0, 0x8, 0x4, 0xC, 0x2, 0xA, 0x6, 0xE, 0x1, 0x9, 0x5, 0xD, 0x3, 0xB, 0x7, 0xF};
        return (table[c & 0xF] << 4) + table[c >> 4];
    }
    uint32_t reverseBits(uint32_t n) {
        uint8_t * p = (uint8_t *)&n;
        uint32_t ret;
        uint8_t * q = (uint8_t *) &ret;
        q[0] = reverseChar(p[3]);
        q[1] = reverseChar(p[2]);
        q[2] = reverseChar(p[1]);
        q[3] = reverseChar(p[0]);
        return ret;
    }
};