Leetcode 461. Hamming Distance

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

• 32 times

class Solution {
public:
    int hammingDistance(int x, int y) {
        int m = x ^ y;
        int distance = 0;
        while(m) {
            distance += m & 1;
            m = m >> 1;
        }
        return distance;
    }
};

• n times(n is the number of 1)

  class Solution {
  public:
      int hammingDistance(int x, int y) {
          int m = x ^ y;
          int distance = 0;
          while(m) {
              m = m & (m - 1);
              distance++;
          }
          return distance;
      }
  };

Reference

1. https://leetcode.com/problems/hamming-distance/description/