题目描述:
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.
Subscribe to see which companies asked this question.
看到讨论区一个非常牛批的答案,只有一行,感觉自己还有很长的路要修炼。
三行解决public int hammingDistance(int x, int y) { return Integer.bitCount(x^y); }
public static int hammingDistance(int x, int y) { int count=0,xor=x^y; for (int i=0;i<32;i++) count += (xor >> i) & 1; return count; }