Question

题目内容

解题思路

异或位运算 + Brian Kernighan 算法。

代码实现

const hammingDistance = (x: number, y: number): number => {
  let s: number = x ^ y;
  const countOneNums = (n: number): number => {
    let count: number = 0;
    while (n) {
      n &= n - 1;
      ++count;
    }
    return count;
  };
  return countOneNums(s);
};