171.NumberOf1

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 = 4Output: 2Explanation:1   (0 0 0 1)4   (0 1 0 0)       ↑   ↑The above arrows point to positions where the corresponding bits are different.

Subscribe to see which companies asked this question.

 //问题转化为求两个数异或结果中1的个数    public int hammingDistance(int x, int y) {        return NumberOf1(x^y);    }            public int NumberOf1(int n) { int count= 0; while(n !=0){ if((n&1) == 1){ count++; } n = n>>>1;//逻辑右移 } return count;    }