Linux内核Hash链表实现中双指针的使用

### Linux内核Hash链表实现中双指针的使用

c
#include 
#include 
// 结构体定义：哈希节点
struct Node {
    int key;
    int value;
    struct Node* next;
};
// 插入节点到哈希链表
void insertNode(struct Node head, int key, int value) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->key = key;
    newNode->value = value;
    newNode->next = *head;
    *head = newNode;
    printf("Inserted key: %d, value: %d%
", key, value);
}
// 在哈希链表中查找节点
struct Node* findNode(struct Node* head, int key) {
    struct Node* current = head;
    struct Node* prev = NULL;
    
    while (current != NULL && current->key != key) {
        prev = current;
        current = current->next;
    }
    
    return prev;
}
// 删除哈希链表中的节点
void deleteNode(struct Node head, int key) {
    struct Node* prev = findNode(*head, key);
    
    if (prev == NULL) {
        printf("Key not found%
");
        return;
    }
    
    struct Node* temp = prev->next;
    prev->next = temp->next;
    free(temp);
    printf("Deleted key: %d%
", key);
}
int main() {
    struct Node* hashTable[10]; // 假设哈希表大小为10
    for (int i = 0; i < 10; ++i) {
        hashTable[i] = NULL; // 初始化每个槽为空链表
    }
    
    insertNode(&hashTable[3], 30, 300); // 在索引为3的槽中插入节点
    insertNode(&hashTable[3], 33, 330); // 插入另一个节点，发生哈希碰撞
    
    deleteNode(&hashTable[3], 30); // 删除节点
    
    return 0;
}