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
2
31
.
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.
问题描述
汉明距离为x和y中相同位不同元素的个数。
给定x和y,算出它们的汉明距离
问题分析
x和y异或(想一下异或的定义,相同为0, 相异为1), 然后用Integer.bitCount()返回1的个数即可
解法
class Solution {
public int hammingDistance(int x, int y) {
return Integer.bitCount(x ^ y);
}
}