哈希桶和溢出桶解决hash冲突

问题描述

定义结构体

#define ElemType int
#define P 7
#define NULL_DATA -1

struct BucketNode {
	ElemType data[Bucket_Size];
	struct BucketNode* link;
};
BucketNode HashTable1[P];

插入元素

void InitHashTable() {
	int i,j;
	for (i = 0; i < P; i++)
	{
		for (j = 0; j < Bucket_Size; j++)
		{
			HashTable1[i].data[j] = NULL_DATA;//一个数组里存放一个桶（三个元素和指向下一个地址的桶）
		}
		HashTable1[i].link = NULL;
	}
}

int InsertHashTable(ElemType x) {
	int i;
	int index = Hash(x);
	for (i = 0; i < Bucket_Size; i++)
	{
		if (HashTable1[index].data[i] == NULL_DATA) {
			HashTable1[index].data[i] = x;
			return 0;
		}
	}

	//一个桶满了就去创建一个桶
	BucketNode* p = &(HashTable1[index]);//指针p指向第一个桶
	while (p->link != NULL) {
		p = p->link;
		for ( i = 0; i < Bucket_Size; i++)
		{
			if (p->data[i] == NULL_DATA) {
				p->data[i] = x;
				return 0;
			}
		}
	}

	//创建桶并初始化
	BucketNode* s = (BucketNode*)malloc(sizeof(BucketNode));
	for ( i = 0; i < Bucket_Size; i++)
	{
		s->data[i] = NULL_DATA;
	}
	s->link = NULL;

	s->data[0] = x;
	p->link = s;
	return 0;
}

int Hash(ElemType key) {
	return key % P;
}

输出

void show() {
	int i,j;
	for (i = 0; i < P; i++)
	{
		printf("%d:", i);
		for (j = 0; j < Bucket_Size; j++)
		{
			printf("%d,", HashTable1[i].data[j]);		
		}
		printf("——");
		if (HashTable1[i].link != NULL) {
			BucketNode* p = HashTable1[i].link;
			while (p != NULL) {
				for (int k = 0; k < Bucket_Size; k++)
				{
					printf("%d,", p->data[k]);
				}
				printf("——");
				p = p->link;
			}
		}
		printf("\n");
	}
}

测试

int main() {
	InitHashTable();
	int array[] = { 1,8,15,22,29,36,43,44,17,28 };
	for (int i = 0; i < sizeof(array) / sizeof(int); i++)
	{
		InsertHashTable(array[i]);
	}
	show();
	return 0;
}