单链表操作演示----C语言实现

/*单链表操作程序可进行单链表的建立、输入、输出、插入、删除、查找、替换操作。程序以int型为例，若需使用其他类型数据只需修改数据定义输入输出即可。#include "Stdio.h"#include "Conio.h"#include "stdlib.h"#define TURE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;/*根据数据类型修改*/typedef struct LNode{ElemType data;struct LNode *next;}LNode;/*程序中做了两个单链表建立函数：L_CreatList与L_CreatList_1L_CreatList为顺序输入函数，例输入：1 2 3 4在输出时也为1 2 3 4。L_CreatList_1则为逆序输入函数，例输入：1 2 3 4在输出时也为4 3 2 1。根据需要选择函数使用，本程序中选择使用L_CreatList函数。*/LNode *L_CreatList(int n)/*单链表顺序输入函数*/{LNode *head,*last,*newnode;int i,j;head=(LNode*)malloc(sizeof(LNode));head->next=NULL;last=head;for(i=1,j=1;i<=n;i++,j++){newnode=(LNode*)malloc(sizeof(LNode));printf("input %d Node:/n",j);scanf("%d",&newnode->data);/*根据情况不同确定输入数据的类型*/newnode->next=NULL;last->next=newnode;last=newnode;}printf("OK!/n/n");return (head);}LNode *L_CreatList_1(int n)/*单链表逆序输入函数*/{LNode *head,*newnode;int i,j;head=(LNode*)malloc(sizeof(LNode));head->next=NULL;for(i=n,j=1;i>0;i--,j++){newnode=(LNode*)malloc(sizeof(LNode));printf("input %d Node:/n",j);scanf("%d",&newnode->data);/*根据情况不同确定输入数据的类型*/newnode->next=head->next;head->next=newnode;}printf("OK!/n/n");return (head);}void L_PrintList(LNode *head)/*单链表输出函数*/ { printf("The LinkList is:/n/n");head=head->next; while(head) { printf("%d ",head->data); head=head->next; } printf("/n"); }Status L_ListInsert(LNode *head,int i,ElemType e)/*单链表数据插入函数，在第i个元素前插入元素e*/ {LNode *p,*newnode;int j=0;p=head;while(p&&j<i-1){p=p->next;++j;}if(!p||j>i-1){printf("ERROR!/n/n");return ERROR;}newnode=(LNode*)malloc(sizeof(LNode));newnode->data=e;newnode->next=p->next;p->next=newnode;printf("OK!/n/n");return OK;}Status L_ListDelete(LNode *head,int i)/*单链表数据删除函数，删除第i个元素*/ {LNode *p,*q;int j=0;p=head;while(p->next&&j<i-1){p=p->next;++j;}if(!(p->next)||j>i-1)return ERROR;q=p->next;p->next=q->next;free(q);printf("OK!/n/n");return OK;}Status L_GetElem(LNode *head,int i)/*单链表元素查找函数，输出第i个元素的值*/{LNode *p;int j=0;while(p&&j<i){p=p->next;++j;}if(!p||j>i){printf("ERROR!/n/n");return ERROR;}printf("The %d Elements is:%d/n",i,p->data);return OK;}Status L_ChangeElem(LNode *head,int i,ElemType e)/*单链表元素替换函数，用e替换第i个元素的值*/{LNode *p;int j=0;while(p&&j<i){p=p->next;++j;}if(!p||j>i){printf("ERROR!/n/n");return ERROR;}p->data=e;printf("The %d Elements has change to %d/n",i,p->data);return OK;}int main(void){LNode *h1;int n,i,e,key=1;highvideo(); textmode(C80); textbackground(11); textcolor(14);clrscr(); window(100,100,600,600);printf("/n/n------------------------------------WELCOME-------------------------------------");printf("/n/nPlease enter the Value of Nodes:");scanf("%d",&n);printf("/n");h1=L_CreatList(n);getch();clrscr(); printf("what do you want to do?/n");printf("q:quit/n");printf("s:clear screen!/n");printf("h:help/n");printf("p:PrintList/n");printf("g:GetElem/n");printf("i:ListInsert/n");printf("d:ListDelete/n");printf("q?s?h?p?g?i?d?/n");while(key!='q'){key=getchar();switch(key){case 'p':L_PrintList(h1);break;case 'i':{printf("ListInsert---please intput i/n:");scanf("%d",&i);printf("ListInsert---please intput e/n:");scanf("%d",&e);L_ListInsert(h1,i,e);}break;case 'd':{printf("ListDelete---please intput i/n:");scanf("%d",&i); L_ListDelete(h1,i);}break;case 'g':{printf("GetElem---please intput i/n:");scanf("%d",&i);L_GetElem(h1,i);}break;case 'c':{printf("ChangeElem---please intput i/n:");scanf("%d",&i);printf("ChangeElem---please intput e/n:");scanf("%d",&e);L_ChangeElem(h1,i,e);}break;case 's':clrscr(); break;case 'h':{printf("q:quit/n");printf("s:clear screen!/n");printf("h:help/n");printf("p:PrintList/n");printf("g:GetElem/n");printf("i:ListInsert/n");printf("d:ListDelete/n");printf("q?s?h?p?g?i?d?/n");}}}clrscr(); puts("/n/nbye!!");getch();return 0;}/*OVER!!*/