reverse bits

最新推荐文章于 2020-10-31 20:31:52 发布

poiop221

最新推荐文章于 2020-10-31 20:31:52 发布

阅读量271

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/poiop221/article/details/47731379

版权

leetcode 专栏收录该内容

174 篇文章 0 订阅

订阅专栏

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as00111001011110000010100101000000).

Follow up:

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

public int reverseBits(int n) {
    int result = 0;
    for (int i = 0; i < 32; i++) {
        result += n & 1;
        n >>>= 1;   // CATCH: must do unsigned shift
        if (i < 31) // CATCH: for last digit, don't shift!
            result <<= 1;
    }
    return result;
}