题目描述:
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.
解题思路:首先将x与y转换为二进制,然后一一比对计数(粗暴解法)
class Solution {
public int hammingDistance(int x, int y) {
int[] bytex = intToByte(x);
int[] bytey = intToByte(y);
int count = 0;
for(int i=31;i>=0;i--){
if(bytex[i] != bytey[i]){
count++;
}
}
return count;
}
public int[] intToByte(int x){
int[] b = new int[32];
int i = 31;
while(x/2!=0){
b[i--]=x%2;
x=x/2;
}
b[i]=x%2;
return b;
}
}
Runtime:1ms
优秀解法:先将x与y 进行异或,然后移位统计与1异或为1的值的数。class Solution {
public int hammingDistance(int x, int y) {
int xor = x ^ y, count = 0;
for (int i=0;i<32;i++) count += (xor >> i) & 1;
return count;
}
}
Runtime:0ms