数据结构：hash桶结构

最新推荐文章于 2024-09-07 07:30:00 发布

让我们荡起双脚

最新推荐文章于 2024-09-07 07:30:00 发布

阅读量4.1k

点赞数 1

分类专栏：数据结构文章标签： hash桶

本文链接：https://blog.csdn.net/liuhuiyan_2014/article/details/47367475

版权

数据结构专栏收录该内容

24 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <stdlib.h>
#define _SIZE_ 7
using namespace std;

template<typename Type>
struct Node
{
    Type data;
    Node *next;
    Node(Type d = Type()) :data(d), next(NULL){}
};

template<typename Type>
struct myNode
{
    Node<Type> node[3];
    int count;
    myNode<Type> *mynext;
    myNode() :mynext(NULL)
    {
        count = 0;
    }
};

template<typename Type>
struct HashNode
{
    myNode<Type> *adj;
    Type flags;
    HashNode(Type d = Type()) :flags(d), adj(NULL){}
};

template<typename Type>
class Hash
{
public:
    Hash()
    {
        int i = 0;
        for (; i < _SIZE_; i++)
        {
            hashNode[i].flags = i;
        }
    }
    int hash(Type val)
    {
        return val%_SIZE_;
    }
    void Insert(int a[], int n)
    {
        int i = 0;
        for (; i < n; i++)
        {
            int index = hash(a[i]);
            myNode<Type> *p = hashNode[index].adj;
            myNode<Type> *s = NULL;
            if (p == NULL)
            {
                s = new myNode<Type>();
                s->node[s->count].data = a[i];
                s->count++;
                p = s;
                hashNode[index].adj = s;
            }
            else
            {
                while (p->mynext != NULL )
                {
                    p = p->mynext;
                }
                if (p->count == 3)
                {
                    s = new myNode<Type>();
                    s->node[s->count++].data = a[i];
                    p->mynext = s;
                    p = s;
                }
                else
                {
                    p->node[p->count++].data = a[i];
                }
            }
        }
    }
    void Printf()
    {
        int i = 0;
        for (; i < _SIZE_; i++)
        {
            cout <<"val="<<  i << ":";
            myNode<Type> *p = hashNode[i].adj;
            while (p != NULL)
            {
                int j = 0; 
                for (; j < p->count; j++)
                {
                    cout << p->node[j].data << "   ";
                }
                p = p->mynext;
            }
            cout << endl;
        }
    }
private:
    HashNode<Type> hashNode[_SIZE_];
};


int main()
{
    int n = 40;
    int *a = new int[n];
    for (int i = 0; i < 40; i++)
    {
        a[i] = rand() % 40;
    }
    Hash<int> sh;
    sh.Insert(a, 40);
    sh.Printf();
    return 0;
}