LeetCode_IDE环境(461hamming distance)

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 ≤ xy < 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 ;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值