/*
哈希表:
*/
#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
typedef struct node
{
char data;
struct node *next;
}link_list;
int main()
{
link_list *p,*p1,*q;
link_list a[10];
int b[10]={19,14,70,21,68,51,84,27,55,11}; // can not have value=0,and bu neng xiang tong
int i,j,val;
int flag=0;
//初始化
p=a;
for(i=0; i<10; p++,i++)
{
p->data = 0; //a[i].data = 0;
p->next = NULL; //a[i].next = NULL;
}
for(i=0; i<10; p++,i++)
{
j = b[i] % 10; //哈希表的实现: 取余数
q=&a[j];
if(q->data == 0) // there are not use
{
q->data = b[i];
printf("q->data=%d \n",q->data);
}
else
{
p1 = malloc(sizeof(link_list));
p1->data = b[i];
p1->next = NULL; //p1->next = a[j].next;
while(q->next != NULL)
q=q->next;//移动到最后一个
q->next = p1; //尾插
printf(" p1->data=%d\n",p1->data);
}
}
printf("\n\n");
//输出
p=a;
for(i=0; i<10; p++,i++)
{
printf("%d %d",i,p->data);
q=p;
while(q->next != NULL)
{
q=q->next;
//printf("%d %d\n",i,q->data);
printf(" --> %d",q->data);
}
printf("\n");
}
//查找
printf("input the numuber of you find: ");
scanf("%d",&val);
p=a;
for(i=0; i<10; p++,i++)
{
if(val == p->data)
{
printf("can find it\n");
flag=1;
}
else if( flag == 0 && i == 9)
printf("can not\n");
q=p;
while(q->next != NULL)
{
q=q->next;
if(val == q->data)
printf("can find it\n"); //输出有些问题,不管了
else if(val == q->data && q->next == NULL)
printf(".. can not\n");
}
}
free(p1);
//free(q);
//free(p); // 你都没有申请,
return 0;
}