LeetCode 461. 汉明距离

/**
 * Created with IntelliJ IDEA.
 * Version : 1.0
 * Author  : 村雨遥
 * Email   : cunyu1024@foxmail.com
 * Website : https://cunyu1943.github.io
 * 公众号   : 村雨遥
 * Date    : 2020/4/11 15:35
 * Project : LeetCode
 * Package : PACKAGE_NAME
 * Class   : FourSixOne
 * Desc    : 461. 汉明距离
 */
public class FourSixOne {
 public static void main(String[] args) throws Exception {
  FourSixOne fourSixOne = new FourSixOne();
  int x = 5;
  int y = 19;
//  3
  System.out.println(fourSixOne.hammingDistance(x, y));
 }

 /**
  * 汉明距离
  *
  * @param x
  * @param y
  * @return 汉明距离
  */
 public int hammingDistance(int x, int y) {
  int distance = 0;
  int diff = 0;

//  转换为二进制字符串
  String strX = Integer.toBinaryString(x);
  String strY = Integer.toBinaryString(y);

  int disBetween = Math.abs(strX.length() - strY.length());
//  比较，将长度较长的字符串的不同字符数找出
  for (int i = 0; i < disBetween; i++) {
   if (strX.length() < strY.length()) {
    if (strY.charAt(i) != '0') {
     diff++;
    }
   } else {
    if (strX.charAt(i) != '0') {
     diff++;
    }
   }

  }

//  通过比较两个二进制字符串，找出不同的位数
  if (strX.length() < strY.length()) {

   for (int j = 0; j < strX.length(); j++) {
    if (strX.charAt(j) != strY.charAt(j + disBetween)) {
     distance++;
    }
   }
  } else {
   for (int k = 0; k < strY.length(); k++) {
    if (strY.charAt(k) != strX.charAt(k + disBetween)) {
     distance++;
    }
   }
  }

//  返回汉明距离
  return distance + diff;
 }
}