1. ListNode 及 HashTable 的類型聲明

• 聲明

  typedef int ElementType; typedef unsigned int Index;struct ListNode; typedef struct ListNode* Position; struct HashTbl; typedef struct HashTbl* HashTable;HashTable InitHashTable(int TableSize); void DestroyHashTable(HashTable H); Position Find(ElementType Element, HashTable H); void Insert(ElementType Element, HashTable H);; ElementType Retrieve(Position P);

• 定義

  struct ListNode{ElementType Element;Position Next; };typedef Position List;struct HashTbl {int TableSize;List* TheLists; };

2. HashTable 的構(gòu)建

HashTable InitHashTable(int TableSize){HashTable H;if (TableSize < MinTableSize){Error(" ... ");return NULL;}H = (HashTable)malloc(sizeof(struct HashTbl));if (!H)FatalError("out of space !!!");H->TableSize = NextPrime(TableSize);H->TheLists = (List*)malloc(sizeof(struct ListNode)*H->TableSize);for (int i = 0; i < H->TableSize; ++i){H->TheLists[i] = (List)malloc(sizeof(struct ListNode));if (!H->TheLists[i])FatalError("");elseH->TheLists[i]->Next = NULL;} }

3. 插入新的結(jié)點(diǎn)

void Insert(ElementType Key, HashTable H){Position Pos, NewCell;List L;Pos = Find(key, H);if (!Pos){NewCell = (Position)malloc(sizeof(struct ListNode));if (!NewCell)FatalError("");L = H->TheLists[Hash(Key, H->TableSize)];NewCell->Next = L->Next;// 插入在首部NewCell->Element = Key;L->Next = NewCell->Next;} }

轉(zhuǎn)載于:https://www.cnblogs.com/mtcnn/p/9423656.html

總結(jié)

以上是生活随笔為你收集整理的HashTable 解决碰撞（冲突）的方法 —— 分离链接法（separate chaining）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。