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

题目链接：https://leetcode.com/problems/hamming-distance/

题目分析：求异或值二进制中1的个数

0ms，时间击败100%

class Solution {
    public int hammingDistance(int x, int y) {
        x = x ^ y;
        int cnt = 0;
        for (int i = 0; i < 32; i++) {
            cnt += (x & (1 << i)) > 0 ? 1 : 0;
        }
        return cnt;
    }
}