单链表的创建、插入和删除（数据结构）——SVS#include#include#includetypedefintElemType;typedefintStatus;typedefstructLNode{ElemTypedata;structLNode*next;}LNode,*LinkList;voidInitList_Link(LinkListL)//创建空链表{L=(LinkList)malloc(sizeof(LNode));L->next=NULL;}StatusInsertList_Link(LinkListL,inti,ElemTypee)//插入链表{LinkLists,p=L;intj=0;while(p&&jnext;j++;}if(!p||j>i-1)return-1;s=(LinkList)malloc(sizeof(LNode));s->data=e;s->next=p->next;p->next=s;return1;}StatusDeleteList_Link(LinkListL,inti,ElemTypee)//删除链表{LinkListq,p=L;intj=0;while(p->next&&jnext;j++;}if(!(p->next)||j>i-1)return-1;q=p->next;e=q->data;p->next=q->next;free(q);return1;}voidOutPutList_Link(LinkListL)//输出链表{printf("表中值为：");LinkListp=L->next;while(p){printf("%d",p->data);p=p->next;}printf("\n");}voidCreateList_Link(LinkListL,intlen)//创建链表{inti;LinkLists,p=L;for(i=0;idata);s->next=NULL;p->next=s;p=s;}}intmain(){intlen;LinkListL;ElemTypee;L=(LinkList)malloc(sizeof(LNode));printf("请输入表长：");scanf("%d",&len);CreateList_Link(L,len);OutPutList_Link(L);/*插入*/intnum1;intnum2;printf("请输入要插入元素的位置：");scanf("%d",&num1);printf("请输入要插入的元素：");scanf("%d",&num2);InsertList_Link(L,num1,num2);printf("插入后:");OutPutList_Link(L);inta;intb=0;printf("请输入要删除元素的位置：");scanf("%d",&a);DeleteList_Link(L,a,b);printf("删除后:");OutPutList_Link(L);}
