哈希表（开放地址法）

实现原理

当发生冲突时，在H(key)的前后找一个空闲单元来存放冲突的记录

实现代码

hash.h

#ifndef _HASH_H_
#define _HASH_H_

typedef int data_t;

typedef struct {

data_t *data;

int maxlen;

}hash,*linhash;

linhash hash_creart(int len); //创建哈希表
int hash_insert(linhash H,data_t data,int maxprime); //将数据插入哈希表
data_t hash_seek(linhash H,data_t data,int maxprime); //查找数据

#endif

hash.c

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include"hash.h"

linhash hash_creart(int len){
	linhash H;
	H = (linhash)malloc(sizeof(hash));
	if(H == NULL){
		printf("H malloc is failed\n");
		return NULL;
	}

	H->data = (data_t *)malloc(len * sizeof(data_t));
	if(H->data == NULL){
		printf("H->data malloc is failed\n");
		return NULL;
	}

	memset(H->data,0,(len * sizeof(data_t)));
	H->maxlen = len;

	return H;
}

int hash_insert(linhash H,data_t data,int maxprime){
	int value,i = 0;

	value = data % maxprime;
	while(H->data[value]){
		i++;

		value = (data + i) % maxprime;
		if(value >= H->maxlen){
			printf("no set\n");
			return -1;
		}
	}
	H->data[value] = data;
	i = 0;
	printf("data %d in %d\n",data,value);
	return 0;

}

data_t hash_seek(linhash H,data_t data,int maxprime){
	int value, i = 0;
	value = data % maxprime;

	while(H->data[value + i] != data){

		if((value + i) >= H->maxlen){
			printf("no the seek data\n");
			return -1;
		}

		i++;
	}
	return H->data[value + i];
}

main.c

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include"hash.h"


int main(){
	linhash H;
	int len,maxprime,maxinput,data,i = 0;
	printf("input len\n");
	scanf("%d",&len);
	getchar();
	H = hash_creart(len);

	if((len % 2) == 0){
		maxprime = len - 1;//实际应该取小于len的最大质数，在本程序里没用最大质数，用的最大奇数
	}else{
		maxprime = len;
	}

	maxinput = (len * 75) / 100; //存储数据与存储空间占比75%

	printf("hash maxlen %d,maxinput %d,maxprime %d\n",len,maxinput,maxprime);
	printf("input data\n");
	while(i < maxinput){         //装入数据
		scanf("%d",&data);
		if(data == -1){
			break;
		}
		hash_insert(H,data,maxprime);
		i++;
	}

	printf("input seek data\n");

	while(1){                 //查找数据
		scanf("%d",&data);
		getchar();
		if(data == -1){
			break;
		}

		i = hash_seek(H,data,maxprime);

		if(i == -1){
			continue;
		}

		printf("seek data %d,hash data %d\n",data,i);
	}
	return 0;
}

执行结果

input len
15
hash maxlen 15,maxinput 11,maxprime 15
input data
23
data 23 in 8
34
data 34 in 4
14
data 14 in 14
38
data 38 in 9
46
data 46 in 1
16
data 16 in 2
68
data 68 in 10
15
data 15 in 0
7
data 7 in 7
31
data 31 in 3
26
data 26 in 11
input seek data
23
seek data 23,hash data 23
16
seek data 16,hash data 16
10
no the seek data
20
no the seek data