LeetCode 461. Hamming Distance

最新推荐文章于 2025-07-26 16:50:34 发布

原创最新推荐文章于 2025-07-26 16:50:34 发布 · 797 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

比特专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种计算两个整数间汉明距离的方法。汉明距离是指两个整数对应的二进制位中不同的位数。文章提供了一个逐个比特扫描比较的具体实现方案。

原题网址：https://leetcode.com/problems/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.

方法：逐个比特扫描比较。

public class Solution {
    public int hammingDistance(int x, int y) {
        int dist = 0;
        while (x != 0 || y != 0) {
            int lx = x & -x;
            int ly = y & -y;
            if (lx == 0) {
                dist++;
                y -= ly;
            } else if (ly == 0) {
                dist++;
                x -= lx;
            } else if (lx < ly) {
                dist++;
                x -= lx;
            } else if (lx > ly) {
                dist++;
                y -= ly;
            } else {
                x -= lx;
                y -= ly;
            }
        }
        return dist;
    }
}