Leetcode 461 Hamming Distance

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 < 2³¹.

Example:

Input: x = 1, y = 4Output: 2Explanation:1   (0 0 0 1)4   (0 1 0 0)       ↑   ↑The above arrows point to positions where the corresponding bits are different.

public class Solution {    public int hammingDistance(int x, int y) {        int[] a = new int[32];        int[] b = new int[32];        int i = 0, j = 0, sum = 0;        while(x > 0)        {            a[i++] = x%2;            x = x/2;        }        while(y > 0)        {            b[j++] = y%2;            y = y/2;        }        for(int k = 0; k < (i>j?i:j); k++)        {            if(a[k] != b[k])              sum++;        }      return sum;        }}