在哈希表中找到最大值，然后打印具有该值的所有变量(在C中)

#include <stdio.h>
#include <stdlib.h>

#define HASH_SIZE 100

// 定义哈希表节点结构
typedef struct Node {
    int key;
    int value;
    struct Node* next;
} Node;

// 创建哈希表
Node** createHashTable() {
    Node** hashTable = (Node**)malloc(sizeof(Node*) * HASH_SIZE);
    for (int i = 0; i < HASH_SIZE; i++) {
        hashTable[i] = NULL;
    }
    return hashTable;
}

// 哈希函数
int hash(int key) {
    return key % HASH_SIZE;
}

// 向哈希表中插入键值对
void insert(Node** hashTable, int key, int value) {
    int index = hash(key);
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->key = key;
    newNode->value = value;
    newNode->next = NULL;

    if (hashTable[index] == NULL) {
        hashTable[index] = newNode;
    } else {
        Node* curr = hashTable[index];
        while (curr->next != NULL) {
            curr = curr->next;
        }
        curr->next = newNode;
    }
}

// 在哈希表中查找最大值，并打印具有该值的所有变量
void findMaxValue(Node** hashTable) {
    int max_value = INT_MIN;
    Node* max_nodes = NULL;

    for (int i = 0; i < HASH_SIZE; i++) {
        Node* curr = hashTable[i];
        while (curr != NULL) {
            if (curr->value > max_value) {
                max_value = curr->value;
                max_nodes = curr;
            } else if (curr->value == max_value) {
                curr->next = max_nodes;
                max_nodes = curr;
            }
            curr = curr->next;
        }
    }

    printf("最大值为：%d\n", max_value);
    printf("具有最大值的变量：");
    Node* curr = max_nodes;
    while (curr != NULL) {
        printf("%d ", curr->key);
        curr = curr->next;
    }
    printf("\n");
}

int main() {
    Node** hashTable = createHashTable();

    // 向哈希表中插入键值对
    insert(hashTable, 1, 10);
    insert(hashTable, 2, 20);
    insert(hashTable, 3, 30);
    insert(hashTable, 4, 40);
    insert(hashTable, 5, 50);
    insert(hashTable, 6, 50);

    // 在哈希表中查找最大值，并打印具有该值的所有变量
    findMaxValue(hashTable);

    return 0;
}