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…

public class Solution { public int HammingDistance(int x, int y) { ]; ]; ; ; do { aryA[i] = x % ;//将10进制转换为2进制 x = x / ; i++; } ); do { aryB[j] = y % ;//将10进制转换为2进制 y = y / ; j++; } ); ; ; k < ; k++) { if (aryA[k] != aryB[k])//查找对应的二进制位,如果一个是0一个是1 {…