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.
public class Solution {
public int HammingDistance(int x, int y) {
int diff = 0;
for(int i=0;i<32;i++){
int x1 = x&1;
int y1 = y&1;
if(x1!=y1){
diff++;
}
x=x>>1;
y=y>>1;
}
return diff;
}
}Time Complexity: O(nlogn) which is the number of digits.
Space Complexity: O(1)
