@@ -0,0 +1,435 @@
+package leetcode.number_of_1_bits;%0A%0Apublic class Solution %7B%0A    // you need to treat n as an unsigned value%0A    public int hammingWeight(int n) %7B%0A        n = n - ((n %3E%3E 1) & 0x55555555);%0A        n = (n & 0x33333333) + ((n %3E%3E 2) & 0x33333333);%0A        return (((n + (n %3E%3E 4)) & 0x0F0F0F0F) * 0x01010101) %3E%3E 24;%0A    %7D%0A    %0A    public static void main(String%5B%5D args)%7B%0A        System.err.println(new Solution().hammingWeight(-1));%0A    %7D%0A%7D%0A

Add java solution for 191. Number of 1 Bits