leetcode解题: Reverse Bits (190)

发表于 | 分类于

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

解法1：

C++

1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        int res = 0;
        for (int i = 0; i < 32; ++i) {
            res <<= 1;
            int bit = n & 1;
            res = res | bit;
            n >>= 1;
        }
        return res;
    }
};

Java

1

Follow up

本题的follow up的解法参考这个帖
子