数据结构 C 哈希表

"C
#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;
}

/**
 * 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';
}

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));
}

int main() {
    hashSearchTest();
    return 1;
}

This is the code."

运行结果