哈希查找

typedef struct NODE
{
    int nValue;
    int xb;
    struct NODE* pNext;
}Node;


Node** CreateHX(int* arr,int length)
{
    //创建一个指针数组 
    Node** ptemp = (Node**)malloc(sizeof(Node*) * length);
    memset(ptemp,0,sizeof(Node*)*length);
    
    int j;
    for(int i=0;i<length;i++)
    {
        //求整取余 
        j = arr[i]%length;
        Node* p = (Node*)malloc(sizeof(Node));
        p->nValue = arr[i];
        p->xb = i;
        p->pNext = NULL;
        //链表的头添加 
        if(ptemp[j] == NULL)
        {
            ptemp[j] = p;                
        }
        else
        {
            p->pNext = ptemp[j];
            ptemp[j] = p;
        }
    }
    return ptemp;
}

int Search(Node** node,int* arr,int length,int num)
{
    //得到余数，哈希表的下标 
    int j = num%length;
    Node* ptemp = NULL;
    if(node[j])
    {
        //得到链表头 
        ptemp = node[j];
        while(ptemp != NULL)
        {
            if(ptemp->nValue == num)
                return ptemp->xb;
            ptemp = ptemp->pNext;    
        }
    }
    return -1;
}

void DeleteHX(Node** pNode,int length)
{
    Node* p = NULL;
    for(int i=0;i<length;i++)
    {
        while(pNode[i])
        {
            p = pNode[i];
            pNode[i] = pNode[i]->pNext;
            free(p);
            p = NULL;
        }
    }

    free(pNode);
}