Leetcode461. Hamming Distance不要太简单哦

最新推荐文章于 2026-05-16 07:14:23 发布

原创最新推荐文章于 2026-05-16 07:14:23 发布 · 2.5k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#LeetCode #面试 C++

收录于

面试题算法题专栏收录该内容

169 篇文章

订阅专栏

本文介绍了一种计算两个整数之间汉明距离的方法。汉明距离是指两个整数对应的二进制位中不同位的数量。文章通过示例解释了如何手动计算汉明距离，并提供了一个C++实现来自动化这一过程。

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.

class Solution {
public:
int hammingDistance(int x, int y) {
int num = 0;
for (int i = 0; i < 32; i++)
{
int val = 1 << i;
if (val > x && val > y) {
break;
}
if ((x & val) != (y & val)) {
num++;
}
}
return num;
}
};