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.

 1 public class Solution {
 2     public int hammingDistance(int x, int y) {
 3         int count = 0;
 4         for (int i = 0; i <= 31; i++) {
 5             int value1 = (x >> i) & 1;
 6             int value2 = (y >> i) & 1;
 7             count += (value1 ^ value2);
 8         }
 9         return count;
10     }
11 }

 

转载于:https://www.cnblogs.com/beiyeqingteng/p/6243867.html