190. Reverse Bits

Total Accepted: 54042
Total Submissions: 185450
Difficulty: Easy

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

Java:

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
        int res = 0;
        for (int i = 0; i < 32; ++i) {
            res <<= 1;
            if(n != 0){
                res += n % 2;
                n >>>= 1;
            }
        }
        return res;
    }
}

打个小广告

欢迎加入我的小专栏「基你太美」一起学习。