[LeetCode 190]Reverse Bits

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

Mavs

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

阅读量510

点赞数

分类专栏： Java Leetcode 文章标签： leetcode math

本文链接：https://blog.csdn.net/sbitswc/article/details/48027597

版权

Leetcode 同时被 2 个专栏收录

287 篇文章 0 订阅

订阅专栏

Java

106 篇文章 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[] bits = new int[32];
        Arrays.fill(bits, 0);
        int num = 0;
        if(n<0){
            bits[31] = 1;
            n = n^ Integer.MIN_VALUE;
        }
        for(int i=0;i<bits.length-1;i++){
            bits[i] = n%2;
            n /=2;
        }
        for(int i=1;i<bits.length;i++){
            num<<=1;
            num+=bits[i];
        }
        return (bits[0]==1)? num|Integer.MIN_VALUE:num; 
    }