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

解题思路：
题目不难，直接上代码。

代码：

class Solution {
public:
    int hammingDistance(int x, int y) {
        int num = 0;
        int tmp = x xor y;
        while (tmp != 0) {
            if (tmp % 2)
                num ++;
            tmp /= 2;
        }
        return num;
    }
};