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
#include<iostream>
using namespace std;
class Solution {
public:
int hammingDistance(int x, int y) {
int xoy= x ^ y, count = 0;
while (xoy > 0)
{
count += (xoy&1);
xoy = xoy >> 1;
}
return count;
}
};
int main()
{
int aa =55, bb = 111;
Solution sol;
int result;
result = sol.hammingDistance(aa, bb);
cout <<"hamming distance between "<<aa<<" and "<<bb<<" is :"<< result << endl;
system("pause");
return 0 ;
}