@@ -0,0 +1,303 @@
+package leetcode.reverse_bits;%0A%0Apublic class Solution %7B%0A    // you need treat n as an unsigned value%0A    public int reverseBits(int n) %7B%0A        int out = 0;%0A        for(int i = 0; i %3C 32; i++)%7B%0A            out %3C%3C= 1;%0A            out %7C= n & 1;%0A            n %3E%3E= 1;%0A        %7D%0A        return out;%0A    %7D%0A%7D%0A

Add java solution for 190. Reverse Bits