Leetcode•Apr 07, 2025
461 Hamming Distance
Hazrat Ali
Leetcode
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
Given two integers x and y, return the Hamming distance between them.
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.
Example 2:
Input: x = 3, y = 1 Output: 1
* 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.
*/
Solution :
/**
* @param {number} x
* @param {number} y
* @return {number}
*/
const hammingDistance = (x, y) => {
let dist = 0;
let n = x ^ y;
while (n) {
dist++;
n &= n - 1;
}
return dist;
};