LeetCode 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 < 2^31.

The original problem is here.

My Solution

I solve this problem in C++, as below:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution {
	public:
	    int hammingDistance(int x, int y) {
	        int big = x > y ? x : y;
	        int small = x < y ? x : y;
	        int distance = 0;
	        int bigMod, smallMod;
	        while(big > 0) {
	            bigMod = big % 2;
	            smallMod = small % 2;
	            if(bigMod != smallMod) {
	                distance ++;
	            }
	            big = big / 2;
	            small = small / 2;
	        }
	        return distance;
	 }
};

Note

To solve the problem, convert the integer to binary and compare the every bit.