package leetcode.reverse_bits;

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
        int out = 0;
        for(int i = 0; i < 32; i++){
            out <<= 1;
            out |= n & 1;
            n >>= 1;
        }
        return out;
    }
}

Add java solution for 190. Reverse Bits
Add java solution for 190. Reverse Bits

190. Reverse Bits: https://leetcode.com/problems/reverse-bits/