C语言哈希表的线性探测法

#include
#include

#define NUM 5

typedef struct HashList
{
	int num;
	char* data;
}HashList;

HashList* initList()
{
	HashList* list = (HashList*)malloc(sizeof(HashList));
	list->num = 0;
	list->data = (char*)malloc(sizeof(char) * NUM);
	for (int i = 0; i < NUM; i++)
	{
		list->data[i] = 0;
	}
	return list;
}

int hash(int data)//计算hash值
{
	return data % NUM;
}

void put(HashList* list, char data)//往hash存
{
	int index = hash(data);
	if (list->data[index] != 0)//如果有值
	{
		int count = 1;
		while (list->data[index] != 0)//如果还有值那就进行线性探测法
		{
			index = hash(hash(data) + count);
			count++;
		}
	}
	//无值就直接存储
	list->data[index] = data;

}

int main()
{
	HashList* list = initList();
	put(list, 'A');
	put(list, 'F');
	printf("%c\n", list->data[0]);
	printf("%c\n", list->data[1]);
	return 0;
}
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