链表的插入,删除.docVIP

#include stdio.h #includemalloc.h #define OVERFLOW 0 #define TRUE 1 #define FALSE -1 typedef struct Node { int data; struct Node *next; }Node,*LinkList; LinkList *create(LinkList *L) { Node *r,*s; int c; int i,n; *L=(LinkList)malloc(sizeof(Node)); r=*L; printf(请输入插入的长度n的值：); scanf(%d,n); for(i=1;i=n;i++) { printf(请输入初始数值c：); scanf(%d,c); s=(LinkList)malloc(sizeof(Node)); s-data=c; s-next=NULL; r-next=s; r=s; } return L; } int ListInsert(LinkList *L,int i,int e) { Node *p,*s; int j=0; p=*L; while(p!=NULLji-1) { p=p-next; j++; } if(j!=i-1) return FALSE; s=(LinkList)malloc(sizeof(Node)); s-data=e; s-next=p-next; p-next=s; return TRUE; } int ListDelete(LinkList *L,int i,int *e) { Node *p,*r; int j=0; p=*L; while(p!=NULLji-1) { p=p-next; j++; } if(j!=i-1) return FALSE; r=p-next; p-next=p-next-next; *e=r-data; free(r); return TRUE; } int ListLength (LinkList L) { Node *p; int j = 0; p = L - next; while (p != NULL) { p = p - next; j ++; } return j; } LinkList Locate (LinkList L, int e) { Node *p; p = L - next; while ((p != NULL) (p - data != e)) { p = p - next; } return p; } LinkList GetElem (LinkList L, int i) { Node *p; int j = 0; p = L; while ((p - next != NULL) (j i)) { p = p - next; j ++; } return p; } void main() { int select,i,returnvalue,e; struct Node *L; do { printf(\n1:初始化单链表表\n); printf(2:单链表的列出\n); printf(3:单链表的值删除\n); printf(4:单链表的值插入\n); printf(5:单链表的值查找\n); printf(6:单链表数据查找\n); printf(7:单链表的长度\n); printf(0:单链表的退出\n); printf(\n请输入你的选项：); scanf(%d,select); switch(select) { case 1:create(L); break; case 2: i=0; do { i++; L=L-next; printf(输出的第%d个数据是：%d\n,i,L-data);