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 < 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.

My naive code:

public class Solution {
    public int hammingDistance(int x, int y) {
        int re=0;
        while(x!=0||y!=0){
            int i=0;
            int j=0;
            if(x!=0){
                i=x%2;
                x/=2;
            }
            if(y!=0){
                j=y%2;
                y/=2;
            }
            if(i!=j)
                re++;
        }
        return re;
    }
}

Use built-in function:Discuss

public class Solution {
    public int hammingDistance(int x, int y) {
        return Integer.bitCount(x^y);
    }
}