-
Notifications
You must be signed in to change notification settings - Fork 2
/
461_Hamming_Distance.c
55 lines (46 loc) · 1.45 KB
/
461_Hamming_Distance.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/***************************************************************
* Copyright (C) 2017 All rights reserved.
*
* 文件名称:461_hanming_distance.c
* 创 建 者:hyb
* 创建日期:2017年08月01日
* 描 述:
*
***************************************************************/
/**************************************************************
题目:
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.
释义:
分析:
两个数的汉明距离,可以理解为,二进制的情况下,两个数异或之后的数的1的个数。
比如例子中,1和4,0001与0100异或得:0101,而0101中1的个数,即为汉明距离,可以理解位,从0001,变成0100,需要改变的位数。
***************************************************************/
#include "leetcode_functions.h"
int hammingDistance(int x,int y)
{
int result = 0;
/*get the temp result*/
int temp = x^y;
/*calc the 1 of temp result*/
while (temp != 0)
{
if (temp % 2 == 1)
{
result++;
}
temp = temp >>1;
}
printf(" the hamming distance is %d\n",result);
return result;
}