leetcode 461.Hamming Distance(easy)[位运算]

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

Example:

Input: x = 1, y = 4Output: 2Explanation:1   (0 0 0 1)4   (0 1 0 0)       ↑   ↑The above arrows point to positions where the corresponding bits are different.

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