数据结构 哈希表

散列表（Hash table，也叫哈希表），是根据关键码值(Key value)而直接进行访问的数据结构。也就是说，它通过把关键码值映射到表中一个位置来访问记录，以加快查找的速度。这个映射函数叫做散列函数，存放记录的数组叫做散列表。

给定表M，存在函数f(key)，对任意给定的关键字值key，代入函数后若能得到包含该关键字的记录在表中的地址，则称表M为哈希（Hash）表，函数f(key)为哈希(Hash) 函数。

代码

/**
 * Hash table.
 * 
 * @author Fan Min minfanphd@163.com.
 */
#include <stdio.h>
#include <malloc.h>

#define TABLE_SIZE 19

/**
 * <key, value> pair.
 */
typedef struct Node{
	int key;
	char value;
}Node, *NodePtr;

/**
 * <key, value> pair.
 */
typedef struct HashList{
	int length;
	NodePtr elements;
}HashList, *ListPtr;

/**
 * Initialize a data array.
 */
ListPtr initList(int* paraKeys, char* paraValues, int paraLength){
	int i, tempPosition;
	ListPtr resultPtr = (ListPtr)malloc(sizeof(struct HashList));

	// Step 1. Initialize.
	resultPtr->length = paraLength;
	resultPtr->elements = (NodePtr)malloc(TABLE_SIZE * sizeof(struct Node));
	for (i = 0; i < TABLE_SIZE; i ++){
		resultPtr->elements[i].key = -1;
		resultPtr->elements[i].value = 'x';
	}//Of for i

	// Step 2. Fill the data.
	for (i = 0; i < paraLength; i++) {
		// Hash.
		tempPosition = paraKeys[i] % TABLE_SIZE;

		// Find an empty position
		while (resultPtr->elements[tempPosition].key != -1) {
			tempPosition = (tempPosition + 1) % TABLE_SIZE;
			printf("Collision, move forward for key %d.\r\n", paraKeys[i]);
		} // Of while

		// printf("Inserting %d to %d\r\n", paraKeys[i], tempPosition);

		resultPtr->elements[tempPosition].key = paraKeys[i];
		resultPtr->elements[tempPosition].value = paraValues[i];
	} // Of for i

	return resultPtr;
}//Of initList

/**
 * Hash search.
 * 
 * @param paraKey The given key.
 * @return The content of the key.
 */
char hashSearch(ListPtr paraPtr, int paraKey) {
	int tempPosition = paraKey % TABLE_SIZE;
	// printf("For %d\r\n", paraKey);
	// printf("Looking at position %d\r\n", tempPosition);
	while (paraPtr->elements[tempPosition].key != -1) {
		if (paraPtr->elements[tempPosition].key == paraKey) {
			// printf("Found\r\n");
			return paraPtr->elements[tempPosition].value;
		} // Of if
		// printf("Not this one for %d.\r\n", paraKey);
		tempPosition = (tempPosition + 1) % TABLE_SIZE;
		// printf("Looking at position %d\r\n", tempPosition);
	} // Of while

	return 'x';
}// Of hashSearch


void hashSearchTest() {
	int tempUnsortedKeys[] = { 16, 33, 38, 69, 57, 95, 86 };
	char tempContents[] = { 'h', 'e', 'l', 'o', 'w', 'r', 'd' };
	ListPtr tempPtr = initList(tempUnsortedKeys, tempContents, 7);

	printf("Search result of 95 is: %c\r\n", hashSearch(tempPtr, 95));
	printf("Search result of 38 is: %c\r\n", hashSearch(tempPtr, 38));
	printf("Search result of 57 is: %c\r\n", hashSearch(tempPtr, 57));
	printf("Search result of 4 is: %c\r\n", hashSearch(tempPtr, 4));
}// Of hashSearchTest

/**
 * The entrance of the program.
 */
int main() {
	hashSearchTest();
	return 1;
}// Of main

运行结果

Collision, move forward for key 57.
Collision, move forward for key 95.
Collision, move forward for key 95.
Search result of 95 is: r
Search result of 38 is: l
Search result of 57 is: w
Search result of 4 is: x
Press any key to continue