Status InitList(LinkList L){
L =(LinkList)malloc(sizeof(LNode));if(!L){exit(-1);}
L->next =NULL;return OK;}
求线性表的表长
Status GetListLen(LinkList L){
LinkList P;int count =0;
P = L->next;while(P){
P = P->next;
count++;}return count;}
查找指定位序的元素
Status CheckListByOrder(LinkList L,int k){
LinkList P;int count =1;
P = L->next;while(P && count < k){
P = P->next;
count++;}if((count == k)&&P){printf("你查找的元素为:%d\n",P->data);}else{printf("元素不存在\n");}}
按值查找线性表的元素
Status CheckListValue(LinkList L,int X){
LinkList P;
P = L->next;while(P &&(P->data!=X)){
P = P->next;}if(P){printf("查找成功,你查找的元素为:%d",P->data);}else{printf("没有此元素");}}
向线性表中插入元素
Status InsertList(LinkList L,int i, ElemType e){
LinkList P, S;int count =0;
P = L;while(P &&(count < i-1)){
P = P->next;
count++;}if(!P || count > i-1){return-1;}else{
S =(LinkList)malloc(sizeof(LNode));
S->data = e;
S->next = P->next;
P->next = S;}return OK;}
删除线性表中指定的元素
Status DeleteList(LinkList L,int i){
LinkList P, Q;int count =0;
P = L;while(P && count < i-1){
P = P->next;
count++;}if(!(P->next)&& count >i-1){printf("参数错误!\n");}else{
Q = P->next;
P->next = Q->next;free(Q);}return OK;}
输出线性链表
voidExportList(LinkList L){
LinkList P = L->next;printf("更新的链表为:");while(P){printf("%d\t",P->data);
P = P->next;}}