链表操作1
来源:互联网 发布:网络真人视频赌博揭秘 编辑:程序博客网 时间:2024/06/06 20:20
#include <stdio.h>
#include <conio.h>
#define N 10
typedef struct node //定义一个结构体
{
char name[20];
struct node *link; //指针域
}stud;
stud * creat() //构造一个链表
{
stud *p,*h,*s; //声明结构指针变量
int i,n;
puts("\nPlease input the number of linklist:");
scanf("%d",&n);
if((h=(stud *)malloc(sizeof(stud)))==NULL) //检测有没空闲的内存空间,没有就返回0
{
printf("cannot find space!");
exit(0);
}
h->name[0]='\0';
h->link=NULL;
p=h;
for(i=0;i<n;i++)
{
if((s= (stud *) malloc(sizeof(stud)))==NULL)
{
printf("cannot find space!");
exit(0);
}
p->link=s;
printf("please input %d student's name: ",i+1);
scanf("%s",s->name);
s->link=NULL;
p=s;
}
return(h);
}
stud * search(stud *h,char *x)
{
stud *p;
char *y;
p=h->link;
while(p!=NULL)
{
y=p->name;
if(strcmp(y,x)==0)
return(p);
else p=p->link;
}
if(p==NULL)
printf("data not find!");
return 0;
}
stud * search2(stud *h,char *x)
{
stud *p,*s;
char *y;
p=h->link;
s=h;
while(p!=NULL)
{
y=p->name;
if(strcmp(y,x)==0)
return(s);
else
{
p=p->link;
s=s->link;
}
}
if(p==NULL)
printf("data not find!");
return 0;
}
void insert(stud *p)
{
char stuname[20];
stud *s;
if((s= (stud *) malloc(sizeof(stud)))==NULL)
{
printf("cannot find space!");
exit(0);
}
printf("\nplease input the student's name: ");
scanf("%s",stuname);
strcpy(s->name,stuname);
s->link=p->link;
p->link=s;
}
void del(stud *x,stud *y)
{
stud *s;
s=y;
x->link=y->link;
free(s);
}
void print(stud *h)
{
stud *p;
p=h->link;
printf("Now the link list is:\n");
while(p!=NULL)
{
printf("%s ",&*(p->name));
p=p->link;
}
printf("\n");
}
void quit()
{
clrscr();
puts("\n Thank you for your using!\n Press any key to quit...");
getch();
exit(0);
}
void menu(void)
{
clrscr();//清屏函数
printf(" simple linklise realization of c\n");
printf(" ||=====================================||\n");
printf(" || ||\n");
printf(" || [1] create linklist ||\n");
printf(" || [2] seach ||\n");
printf(" || [3] insert ||\n");
printf(" || [4] delete ||\n");
printf(" || [5] print ||\n");
printf(" || [6] exit ||\n");
printf(" || ||\n");
printf(" || if no list exist,create first ||\n");
printf(" || ||\n");
printf(" ||=====================================||\n");
printf(" Please input your choose(1-6): ");
}
main()
{
int choose;
stud *head,*searchpoint,*forepoint;
char fullname[20];
while(1)
{
menu();
scanf("%d",&choose);
switch(choose)
{
case 1:
clrscr();
head=creat();//创建链表
puts("Linklist created successfully! \nPress any key to return...");
getch();
break;
case 2:
clrscr();
printf("Input the student's name which you want to find:\n");
scanf("%s",fullname);
searchpoint=search(head,fullname);
printf("The stud name you want to find is:%s",*&searchpoint->name);
printf("\nPress any key to returen...");
getchar();
getchar();
break;
case 3:
clrscr();
insert(head);
print(head);
printf("\nPress any key to returen...");
getchar();getchar();
break;
case 4:
clrscr();
print(head);
printf("\nInput the student's name which you want to delete:\n");
scanf("%s",fullname);
searchpoint=search(head,fullname);
forepoint=search2(head,fullname);
del(forepoint,searchpoint);
print(head);
puts("\nDelete successfully! Press any key to return...");
getchar();
getchar();
break;
case 5:print(head);
printf("\nPress any key to return...");
getchar();getchar();
break;
case 6:quit();
break;
default:
clrscr();
printf("Illegal letter! Press any key to return...");
menu();
getchar();
}
}
}
我的程序运行环境是 linux
- 链表操作1
- 链表操作(1)
- 数据结构链表操作1
- 动态链表操作1
- 实现链表基本操作(简单操作)
- 单向链表基本操作1
- 算法1:链表的基本操作
- 双向链表的操作1
- 链表操作源程序
- 链表操作
- C++ 链表操作
- 链表的操作
- 链表操作源程序
- 链表的操作
- 链表的操作
- C++链表操作
- 链表操作
- 链表操作
- 数列的排列组合求解
- MINI2440i2c驱动学习二
- w3school学习7-jQuery CSS 操作
- supersocket 调试
- MINI2440i2c驱动学习一
- 链表操作1
- Linux的页面回收与反向映射机制
- w3school学习8-jQuery AJAX 函数
- oracle 10g中的正则表达式
- web项目取得spring配置的数据源的简单实现方法
- JSP实现分页功能
- 万有引力
- 内核总结之进程和进程的调度
- centos 安装配置 samba 并实现与windows 共享