C++ Solution of LeetCode 461 Hamming Distance

Description:
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 = 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.

Solution:

class Solution {
public:
    int hammingDistance(int x, int y) {
        int count = 0;
        while(x != 0 || y!= 0){
            if((x&0x1) != (y&0x1)){
                count++;
            }
            x = x >> 1;
            y = y >> 1;
        }
        return count;
    }
};

Note:
x&0x1是用来和1位与，如果是偶数则为0，奇数为1