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;
  }
 };