文档介绍：数据结构编程实例顺序表的基本操作#defineLEN100typedefstructsqlist{inta[LEN];intlength;};voidinit(structsqlist*sq)/*初始化*/{inti;for(i=0;i<LEN;i++)sq->a[i]=0;sq->length=0;}voidcreat(structsqlist*sq)/*建顺序表*/{inti;printf("pleaseinputlength");scanf("%d",&sq->length);printf("pleaseinput%dnums\n",sq->length);for(i=1;i<=sq->length;i++)scanf("%d",&sq->a[i]);}voidprint(structsqlist*sq)/*输出顺序表*/{inti;for(i=1;i<=sq->length;i++)printf("%d",sq->a[i]);printf("\n");}voidinsert(structsqlist*sq,intpos,intx)/*顺序表插入元素*/{inti;for(i=sq->length;i>=pos;i--)sq->a[i+1]=sq->a[i];sq->a[pos]=x;sq->length=sq->length+1;}intdelete(structsqlist*sq,intpos)/*顺序表删除元素*/{inti,x;x=sq->a[pos];for(i=pos+1;i<=sq->length;i++)sq->a[i-1]=sq->a[i];sq->length=sq->length-1;return(x);}main(){intposition,x;structsqlist*list;structsqlistslist;intxz=0;list=&slist;while(1){printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("\n");printf("pleaseinputyourchoice");scanf("%d",&xz);switch(xz){case1:init(list);break;case2:creat(list);break;case3:printf("pleastinputinsetposition(pos)andvalue(x)"); scanf("%d%d",&position,&x); if(position<1||position>list->length+1||list->length>=LEN) printf("positionerror\n"); elseinsert(list,position,x); break;case4:printf("pleastinputdeleteposition(pos)"); scanf("%d",&position); if(position<1||position>list->length||list->length==0) printf("positionerror\n"); elseprintf("deleteposition=%d,deletedata=%d\n",position,delete(list,position)); break;;case5:;case6:;case7:print(list);break;case0:exit(0);}}}三种方法建立链表#include<>typedefstructnode{intdata;structnode*link;}NODE;NODE*creat1()/*按输入数据的顺序建立链表,输入数据通过个数控制*/{inti,data,n;NODE*h=NULL,*p,*last=NULL;printf("pleaseinputthenum:");scanf("%d",&n);printf("pleaseinput%ddatas:",n);for(i=1;i<=n;i++){p=(NODE*)malloc(sizeof(NODE));scanf("%d",&p->data);if(i==1)h=p;elselast->link=p;last=p;}last->link=NULL;return(h);}NODE*creat2()/*按输入数据的逆序建立链表,输入数据以0结束*/{intda