Hash API

最新推荐文章于 2023-08-17 18:38:46 发布

weixin_34232617

最新推荐文章于 2023-08-17 18:38:46 发布

阅读量143

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zyqBlog/p/8033776.html

本文介绍了一种使用链表实现哈希表的方法，并通过C++代码详细展示了哈希表的初始化、插入、搜索和删除操作。该实现利用了节点结构来存储数据，并通过哈希函数确定元素的存储位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
using namespace std;

#define size 100

struct node{

    int val;
    node *pre;
    node *next;

};

int index = 0;
node HashTable[size];
node HashPool[size];

node *getNewNode()
{
    return &HashPool[index++];
}

void init()
{
    index = 0;
    for(int i = 0; i < size; i++)
    {
        HashTable[i].next = &HashTable[i];
        HashTable[i].pre = &HashTable[i];
        HashTable[i].val = 0;
    }
}

void insert(int key,node *newNode)
{
    node *head = &HashTable[key];
    
    newNode->next = head ->next;
    newNode->pre = head;
    head ->next->pre = newNode;
    head->next = newNode;
    
}

node * searchNode(int key,node *newNode)
{
    node *x = HashTable[key].next;
    while(x != &HashTable[key]){
        x = x->next;
    }
    if(x != &HashTable[key])
        return x;
    else return NULL;
}

void deleteNode(node * node){
    node->pre->next = node->next;
    node->next->pre = node->pre;
}

int main()
{
    init();
    for(int i = 0; i < 100; i++)
    {
        int num = rand()%100+1;
        int key = num % 11;
        HashTable[key].val++;
        node *newNode = getNewNode();
        newNode->val = num;
        insert(key,newNode);
    }

    for(int i = 0; i < 100; i++)
    {
        if(HashTable[i].val != 0)
        {
            cout << i << " ";
            cout << HashTable[i].val << " : " ;
            node *head = (&HashTable[i]) -> next;
            while(head != &HashTable[i])
            {
                cout << head->val << "  ";
                head = head -> next;
            }
            cout << endl;
        }
    }
    return 0;
}