LeetCode 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 < 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.

问题描述

汉明距离是指两个整数对应的二进制位不相同的个数。

解体思路

对两个数做异或运算，在统计结果中1的个数

代码实现

/*C++ */
class solution{
public:
  int hammingDistance(int x,int y){
      int dist = 0, n = x^y;
      while(n){
          ++dist;
          n= n&(n-1);
      }
      return dist;
  }
 };