代碼實戰(zhàn)：

    //基本結(jié)構(gòu)定義
    #define M 13//選取求哈希地址（散列地址）的除數(shù)(哈希表的長度)
    typedef int KeyType；
    #define NIL -1
    typedef struct {}Record;//記錄集
    typedef struct //key_recptr
    {
         KeyType key;
         Record *recptr;
    } ElemType;
    typedef struct HashNode//哈希表中鏈表的每一個節(jié)點的定義
    {
         ElemType data;
         HashNode *next; 
    }HashNode;
    typedef struct HashTable
    {
          HashNode *table[M];//指針數(shù)組
          int sum;
    }HashTable;

  //購買節(jié)點和釋放節(jié)點
  HashNode *_BuyNode()
  {
       HashNode *s = (HashNode *)malloc(sizeof(HashNode));
       if(NULL == s)   exit(1);
       memset(s,0,sizeof(HashNode));
       return s;
  }
  
  void  _FreeNode( HashNode *p)
  {
        free(p);
  }

  //初始化
  void Init_Hash(HashTable *pt)
  {
       for(int i = 0;i < M;++i)
       {
            pt->table[i] = NULL;
       }
       pt->sum = 0;
  }

   //求哈希地址函數(shù)
   int Hash(KeyType kx)
   {
         return kx % M;
   }
   //查找函數(shù)
   int SearchNot(HashTable *pt,KeyType kx)
   {
        int pos = Hash(kx);
        HashNode *p = pt->table[pos];
        while(p != NULL && p->data.key != kx)
                     p = p->next;
        if(p == NULL)  return pos;
        else return -1;
   }
   //插入函數(shù)
    bool Insert(HashTable *pt,ElemType x)//利用頭插法，時間復(fù)雜度O（1）
    {
          bool res = false;
          int pos = SearchNot(pt,x.key);
          if(pos ！= -1)
          {
                HashNode *s = _BuyNode();
                s->data = x;
                s->next = pt->table[pos];
                pt->table[pos] = s;
                pt->sum += 1;
                res = true;
          }
          return res;
    }
    //刪除函數(shù)
    bool Remove(HashTable *pt,KeyType kx)
    {
          bool res = false;
          int pos = Hash(kx);
          HashNode *pr =  NULL,*p = pt->table[pos];
          while(p != NULL)
          {
                if(p->data.key == kx)
                {
                      if(pr == NULL)
                              pt->table[pos] = p->next;
                       else
                              pr->next = p->next;
                _FreeNode(p);
                res = true;
                break;
                }  
          pr = p;
          p = p->next;
          }
     return res;
    }