Add Solution.java for 0461.Hamming Distance

Author: huaxu1024

solution/0461.Hamming Distance/README_EN.md

@@ -0,0 +1,17 @@
+# Hamming Distance
+
+The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
+
+Given two integers _x_ and _y_, calculate the Hamming distance.
+
+## Example 1:
+```
+ Input: x = 1, y = 4
+ Output: 2
+ 
+ Explanation: 
+     1   (0 0 0 1)
+     4   (0 1 0 0)
+            ↑   ↑
+ The above arrows point to positions where the corresponding bits are different.
+```

solution/0461.Hamming Distance/Solution.java

@@ -0,0 +1,10 @@
+class Solution {
+    public int hammingDistance(int x, int y) {
+        int count = 0, sum = x ^ y;
+        while (sum != 0) {
+            sum &= (sum - 1);
+            count++;
+        }
+        return count;
+    }
+}