数据结构试验线性表的操作.doc

01顺序线性表的基本操作 #includestdio.h #includemalloc.h #define OK 1 #define ERROR 0 #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 #define ElemType int typedef struct { int *elem; int length; int listsize; }SqList; int InitList_Sq(SqList L) { // 算法2.3，构造一个空的线性表L，该线性表预定义大小为LIST_INIT_SIZE L.elem=(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType)); L.length=0; L.listsize=LIST_INIT_SIZE; return OK; } int Load_Sq(SqList L) { // 输出顺序表中的所有元素 int i; if(L.length==0) printf(The List is empty!); // 请填空 else { printf(The List is: ); for(i=0;iL.length;i++) printf(%d ,L.elem[i]); // 请填空 } printf(\n); return OK; } int ListInsert_Sq(SqList L,int i,int e) { // 算法2.4，在顺序线性表L中第i个位置之前插入新的元素e if(i1||iL.length+1) return ERROR; ElemType *newbase,*q,*p; if(L.length=L.listsize) { newbase=(ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType)); L.elem=newbase; L.listsize+=LISTINCREMENT; } q=(L.elem[i-1]); for(p=(L.elem[L.length-1]);p=q;--p) *(p+1)=*p; *q=e; ++L.length; return OK; } int ListDelete_Sq(SqList L,int i, int e) { // 算法2.5,在顺序线性表L中删除第i个位置的元素，并用e返回其值 ElemType *p,*q; if(i1||iL.length) return ERROR; p=(L.elem[i-1]); e=*p; q=L.elem+L.length-1; for(++p;p=q;++p) *(p-1)=*p; --L.length; return OK; } int main() { SqList T; int a, i; ElemType e, x; if(InitList_Sq(T)) // 判断顺序表是否创建成功 { printf(A Sequence List Has Created.\n); } while(1) { printf(1:Insert element\n2:Delete element\n3:Load all elements\n0:Exit\nPlease choose:\n); scanf(%d,a); switch(a) { case 1: scanf(%d%d,i,x); if(!ListInsert_Sq(T,i,x)) printf(Insert Error!\n); // 判断i值是否合法，请填空 else printf(The Element %d is Successfully Inserted!\n, x); break; case 2: scanf(%d,i); if(!ListDelete_Sq(T,i,e)) printf(Delete Error!\n); // 判断i值是否合法，请填空 else printf(The Element %d is Successfully Deleted!\n, e); break; case 3: Load_Sq(T); break; case 0: return 1; } } } 02合并顺序表 #includestdio.h #includemalloc.h #define OK 1 #