leetcode-461. Hamming Distance

Q：

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 = 4Output: 2Explanation:1   (0 0 0 1)4   (0 1 0 0)       ?   ?The above arrows point to positions where the corresponding bits are different.

A：

1. c++

class Solution {
public:
    int hammingDistance(int x, int y) {
        int hamming_distance = 0;
        while(true)
        {
            if(x%2 != y%2)
                hamming_distance += 1;
            if((x/2 == 0)&&(y/2 == 0))
               break;
            x = x/2;
            y = y/2;
        }
        return hamming_distance;
    }
};

2.  java

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