LeetCode_IDE环境(461hamming distance)

最新推荐文章于 2025-11-15 18:08:19 发布

原创最新推荐文章于 2025-11-15 18:08:19 发布 · 255 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#初学者

LeetCode 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种计算两个整数之间汉明距离的方法，即比较两个整数对应的二进制位中不同的位数。通过使用异或运算和位操作，实现了一个高效的算法来计算汉明距离。

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

#include<iostream>

using namespace std;

class Solution {
public:
	int hammingDistance(int x, int y) {
		int xoy= x ^ y, count = 0;
		
		while (xoy > 0)
		{
			count += (xoy&1);
			xoy = xoy >> 1;
		}
		return count;
	}
};

int main()
{
	int aa =55, bb = 111;
	Solution sol;
	int result;

	result = sol.hammingDistance(aa, bb);
	cout <<"hamming distance between "<<aa<<" and "<<bb<<" is :"<< result << endl;
	
	system("pause");
	return 0 ;
}