数据结构[基本操作]程序代码.docxVIP

线性表 顺序表 struct SqList{ int *base; int length; int listsize; }; #includeiostream #includehead.h #includefunction.h using namespace std; void main(){ SqList L; int len; coutplease input the length of the SqList: ; cinlen; coutendl; InitList( len, L); Browse(L); int i,x; coutplease input the location you want to insert: ; cini; coutendlplease input the content you want to insert: ; cinx; coutendl; Insert(L, i, x); Browse(L); int j; coutplease input the number of the data you want to delete: ; cinj; coutendl; Delete( L,j); Browse(L); Destroy(L); } #includeiostream using namespace std; void InitList(int len,SqList L){//创建 L.base=new int[100]; if(!L.base) return; L.length=len; L.listsize=100; coutplease input each data: ; for(int i=0;iL.length;i++){ cinL.base[i]; } coutendl; } void Delete(SqList L,int i){//删除结点 if(iL.length){ couterror; return; } for(int j=i-1;jL.length;j++) L.base[j]=L.base[j+1]; L.length--; } void Browse(SqList L){//遍历 if(L.length==0){ coutEmpty Link! ; return; } for(int i=0;iL.length;i++) coutL.base[i] ; coutendl; } void Destroy(SqList L){//销毁表 delete []L.base; L.length=0; L.listsize=0; cout OK !endl; } void Insert(SqList L,int i,int x){//插入 if(i1||iL.length+1){ coutthe i is illegal ! ; return; } if(L.length=L.listsize) L.base=new int[L.listsize+10]; if(!L.base){ couterror! ; return; } L.listsize =L.listsize+10; L.length++; for(int j=L.length;j=i;j--) L.base[j]=L.base[j-1]; L.base[i-1]=x; } 链表 单向链表 struct LNode{ int data; LNode * next; }; #includeiostream #includehead.h #includefunction.h using namespace std; void main(){ LNode * L1=new LNode; LNode * L2=new LNode; int n; coutplease input the LinkLists length: ; cinn; coutendl; InitList1(L1,n); InitList2(L2,n); Browse(L1,n); Browse(L2,n); int a=ListLength(L1); coutthe length of L1 is aendl; int i,x; coutplease input the lacotion you want to insert: ; cini; coutendlplease input the data you want to i