题目

The Hamming distancebetween 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^31.

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.

答案

class Solution {
    public int hammingDistance(int x, int y) {
        return numberOf1s(x^y);
    }
    public int numberOf1s(int x) {
        int count = 0;
        for(int i = 0; i < 32; i++) {
            int t = x >> i;
            if((t & 1) == 1) count++;
        }
        return count;
    }
}