leetcode-461(Hamming Distance)

Posted 2022-11-26 dongmeima_coder

Description

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.

Solution

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

Conclude

海明距离就是计算两个数异或后的结果中有多少个1.