公司的技能鉴定上机题——Hash冲突排序算法2

公司的技能鉴定上机题——Hash冲突排序算法

DWORD SortByCount::GetHashIndex(DWORD dwHashKey)

{

 return dwHashKey % HASH_SIZE;//返回最后三位数,HASH_SIZE==1000

}

DWORD SortByCount::InsertToHash(DWORD dwValue)

{

 DWORD dwHashIndex = GetHashIndex(dwValue);

 HashList HashHead = m_HashBucket[dwHashIndex];

 //申请节点内存

    DataNode * s = (DataNode*)pmalloc(sizeof(DataNode));

 

 //赋值

    s->dwValue = dwValue;

    s->next = NULL;

 s->prev = NULL;

    //插入链表

    if(0 == HashHead->size)

    {

        //第一次插入节点

        HashHead->Head = s;

  HashHead->Tail = s;

    }

    else

    {

        //插入尾部

  s->prev = HashHead->Tail;

        HashHead->Tail->next = s;

        HashHead->Tail = s;

    }

    HashHead->size++;

 return SUCCESS;

}