跳表

#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#define High 10

//int seed = 0;

FILE *fp;

typedef struct Build {
int element;
struct Build *next[High];
}Building;

Building *Create();
Building *Search(Building *Head, int element, int *count);
void Insert(Building *Head, int element);
int CreateHigh();
void Read(Building *Head);
void Print(Building *Head);
void Delete(Building *Head, int element);//Delete之前要查找是否有这个数；
int Menu();

int main()
{
int element;
int count;
int choice;
Building *building;
Building *head;
head = Create();
//Read(head);//有问题，读的时间太快，产生的随机数相同；
while (1)
{
choice = Menu();
switch (choice)
{
case 1:
printf(“请输入插入的值(-1退出)：”);
scanf("%d", &element);
while (element != -1) {
Insert(head, element);
printf(“请输入插入的值(-1退出)：”);
scanf("%d", &element);
}
break;
case 2:
printf("\n请输入查找的值(-1退出)：");
scanf("%d", &element);
while (element != -1) {
building = Search(head, element, &count);
if (building == NULL)
printf(“没有这个数\n”);
else
printf(“找到:%d 寻找次数:%d\n”, building->element, count);
printf("\n请输入查找的值(-1退出)：");
scanf("%d", &element);
}
break;
case 3:
printf(“delete\n”);
scanf("%d", &element);
while (element != -1) {
Delete(head, element);
printf(“请输入删除的值(-1退出)：”);
scanf("%d", &element);
}
break;
case 4:
Print(head);
break;
default:
printf(“不合法的输入\n”);
}
}
}

Building *Create()
{
Building *head = (Building *)malloc(sizeof(Building));
head->element = -1;
for (int i = 0; i < High; i++)
{
head->next[i] = NULL;
}
return head;
}
Building *Search(Building *Head, int element, int *count)
{
Building *p = Head;
*count = 0;
for (int i = High-1; i >= 0; i–)
{

	if (p->next[i] != NULL && p->next[i]->element <= element)//如果直到i==0；都没成功就返回NULL
	{
		while (p->next[i] != NULL&&p->next[i]->element <= element)
		{
			(*count)++;
			p = p->next[i];
		}
		if (p->element == element)
			//return p->next[i];//找到!!!
			return p;
		if (i == 0)
			return NULL;
	}
	//else if (p->next[i]->element > element)
	//{
	//	if (i == 0)
	//		return NULL;
	//}
	else if (i == 0)
		return NULL;
	//(*count)++;
}

}
void Insert(Building Head, int element)
{
int count = 1;
Building building = (Building )malloc(sizeof(Building));
building->element = element;
Building p = Head;
//p = Head;
Building q;
if ((q=Search(Head, element,&count)) != NULL)
{
printf("%d已存在，重新输入.\n",q->element);
//exit(0);//直接退出
}
else {
//int high = CreateHigh();
srand(time(NULL));
int high = rand() % High;
for (int i = high; i >= 0; i–)
{
if (p->next[i] == NULL)
{
p->next[i] = building;
building->next[i] = NULL;
}
else if (p->next[i]->element < element)
{
while (p->next[i] != NULL&&p->next[i]->element < element)
{
p = p->next[i];
}
//if (p->next[i] == NULL)
//if(p->next[i]->element>element)
building->next[i] = p->next[i];
p->next[i] = building;
}
else if (p->next[i] > element)
{
building->next[i] = p->next[i];
p->next[i] = building;
}
}
}
}
int CreateHigh()
{
// int k = 0;
srand(time(NULL));
// srand(seed);
// for (int j = 0; j < 100; j++)
// for (int t = 0; j < 100; j++)
// k += 3;
int t = rand() % High;
// seed = rand() % (t + 1);
return t;
}
void Read(Building Head)
{
int element;
if ((fp = fopen(“input.txt”, “r”)) == NULL)
{
printf(“can’t open file/n”);
}
else
{
fscanf(fp, “%d”, &element);
while (element != -1)
{
Insert(Head, element);
fscanf(fp, “%d”, &element);
}
}
printf(“读取文件完毕\n”);
fclose(fp);
}
void Print(Building Head)
{
Building p = Head;
for (int i = High-1; i >= 0; i–)
{
p = Head;
printf("%d", p->element);
while (p->next[i] != NULL)
{
p = p->next[i];
printf(" -> %d", p->element);
}
printf(" -> NULL\n");
}
}
void Delete(Building Head, int element)
{
Building p = Head;
for (int i = High - 1; i >= 0; i–)
{
if (p->next[i] != NULL && p->next[i]->element <= element)//如果直到i==0；都没成功就返回NULL
{
while (p->next[i] != NULL&&p->next[i]->element < element)
{
p = p->next[i];
}
if (p->next[i]->element == element)
{
p->next[i] = p->next[i]->next[i];
}
}
}
}
int Menu()
{
int choice;
printf("********************************\n");
printf(“1.插入 2.查找 3.删除\n”);
printf(“4.打印\n”);
printf("******************************************\n");
printf(“请输入选择的功能：”);
scanf("%d", &choice);
return choice;
}