Question

461. Hamming Distance

中文文档

Description

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

 

Constraints:

• 0 <= x, y <= 231 - 1

Solutions

Solution 1

class Solution:
  def hammingDistance(self, x: int, y: int) -> int:
    return (x ^ y).bit_count()

class Solution {
  public int hammingDistance(int x, int y) {
    return Integer.bitCount(x ^ y);
  }
}

class Solution {
public:
  int hammingDistance(int x, int y) {
    return __builtin_popcount(x ^ y);
  }
};

func hammingDistance(x int, y int) int {
  return bits.OnesCount(uint(x ^ y))
}

function hammingDistance(x: number, y: number): number {
  x ^= y;
  let ans = 0;
  while (x) {
    x -= x & -x;
    ++ans;
  }
  return ans;
}

/**
 * @param {number} x
 * @param {number} y
 * @return {number}
 */
var hammingDistance = function (x, y) {
  x ^= y;
  let ans = 0;
  while (x) {
    x -= x & -x;
    ++ans;
  }
  return ans;
};