public int hammingDistance(int x, int y) {
String xx = Integer.toBinaryString(x);
String yy = Integer.toBinaryString(y);
if (xx.length()>yy.length()){
int in =xx.length() - yy.length();
for (int i = 0; i <in; i++) {
yy="0"+yy;
}
}else if(xx.length()<yy.length()){
int in =yy.length() - xx.length();
for (int i = 0; i <in; i++) {
xx="0"+xx;
}
}
char[] xxs = xx.toCharArray();
char[] yys = yy.toCharArray();
int num =0;
for (int i = 0; i < xxs.length; i++) {
if (xxs[i]!=yys[i]){
num++;
}
}
return num;
}
汉明距离(力扣题库)
最新推荐文章于 2022-04-23 20:54:08 发布