#include <stdio.h>
#include <stdlib.h>
#define TABLE_SIZE 100 // 哈希表的大小
// 定義哈希表節(jié)點(diǎn)結(jié)構(gòu)體
typedef struct Node {
    int key; // 節(jié)點(diǎn)鍵值
    int value; // 節(jié)點(diǎn)存儲(chǔ)的值
    struct Node* next; // 指向下一個(gè)節(jié)點(diǎn)的指針
} Node;
// 創(chuàng)建一個(gè)哈希表并返回指針
Node** createHashTable() {
    Node** hashTable = (Node**) malloc(sizeof(Node*) * TABLE_SIZE);
    for (int i = 0; i < TABLE_SIZE; i++) {
        hashTable[i] = NULL;
    }
    return hashTable;
}
// 計(jì)算節(jié)點(diǎn)在哈希表中的下標(biāo)
int getHashIndex(int key) {
    return key % TABLE_SIZE;
}
// 在哈希表中查找指定鍵值的節(jié)點(diǎn)，并返回該節(jié)點(diǎn)的指針
Node* findNode(Node** hashTable, int key) {
    int index = getHashIndex(key);
    Node* node = hashTable[index];
    while (node != NULL) {
        if (node->key == key) {
            return node;
        }
        node = node->next;
    }
    return NULL; // 沒(méi)有找到節(jié)點(diǎn)，返回NULL
}
// 插入一個(gè)節(jié)點(diǎn)到哈希表中
void insertNode(Node** hashTable, int key, int value) {
    int index = getHashIndex(key);
    Node* node = hashTable[index];
    while (node != NULL) {
        if (node->key == key) {
            node->value = value;
            return;
        }
        node = node->next;
    }
    Node* new_node = (Node*) malloc(sizeof(Node));
    new_node->key = key;
    new_node->value = value;
    new_node->next = hashTable[index];
    hashTable[index] = new_node;
}
// 從哈希表中刪除指定鍵值的節(jié)點(diǎn)
void deleteNode(Node** hashTable, int key) {
    int index = getHashIndex(key);
    Node* node = hashTable[index];
    Node* prev = NULL;
    while (node != NULL) {
        if (node->key == key) {
            if (prev == NULL) {
                hashTable[index] = node->next;
            } else {
                prev->next = node->next;
            }
            free(node);
            return;
        }
        prev = node;
        node = node->next;
    }
}
int main() {
    // 創(chuàng)建哈希表
    Node** hashTable = createHashTable();
    // 向哈希表中插入若干個(gè)節(jié)點(diǎn)
    insertNode(hashTable, 1, 2);
    insertNode(hashTable, 2, 4);
    insertNode(hashTable, 3, 6);
    // 查找節(jié)點(diǎn)并輸出結(jié)果
    Node* node = findNode(hashTable, 2);
    if (node != NULL) {
        printf("鍵值為 %d 的節(jié)點(diǎn)的值為 %d\n", node->key, node->value);
    } else {
        printf("沒(méi)有找到鍵值為 2 的節(jié)點(diǎn)\n");
    }
    // 刪除節(jié)點(diǎn)并輸出結(jié)果
    deleteNode(hashTable, 1);
    node = findNode(hashTable, 1);
    if (node != NULL) {
        printf("鍵值為 %d 的節(jié)點(diǎn)的值為 %d\n", node->key, node->value);
    } else {
        printf("沒(méi)有找到鍵值為 1 的節(jié)點(diǎn)\n");
    }
    return 0;
}