solve 461.hamming-distance

Author: andavid

vscode/461.hamming-distance.java

@@ -0,0 +1,50 @@
+/*
+ * @lc app=leetcode id=461 lang=java
+ *
+ * [461] Hamming Distance
+ *
+ * https://leetcode.com/problems/hamming-distance/description/
+ *
+ * algorithms
+ * Easy (70.04%)
+ * Total Accepted:    230.2K
+ * Total Submissions: 327.9K
+ * Testcase Example:  '1\n4'
+ *
+ * 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 < 2^31.
+ *
+ *
+ * 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.
+ *
+ *
+ */
+class Solution {
+  public int hammingDistance(int x, int y) {
+    int result = x ^ y;
+    int count = 0;
+    while (result != 0) {
+      result = result & (result - 1);
+      count++;
+    }
+    return count;
+  }
+}
+