refactor 461

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_461.java

@@ -1,38 +1,15 @@
 package com.fishercoder.solutions;
 
-/**
- * 461. 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.
-
- Note:
- 0 ≤ x, y < 231.
-
- Example:
-
- 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.
- */
 public class _461 {
-	public static class Solution1 {
-		public int hammingDistance(int x, int y) {
-			int n = x ^ y;
-			int count = 0;
-			while (n != 0) {
-				count++;
-				n &= (n - 1);
-			}
-			return count;
-		}
-	}
+    public static class Solution1 {
+        public int hammingDistance(int x, int y) {
+            int n = x ^ y;
+            int count = 0;
+            while (n != 0) {
+                count++;
+                n &= (n - 1);
+            }
+            return count;
+        }
+    }
 }