数据结构顺序链表.docVIP

数据结构顺序链表 1.编写头文件。定义数据类型。分别写各个函数如ListInsern_Sq，ListDelete_Sq，LocateElem等函数。 2.编写主函数。在主函数里构造空的线性表，然后利用ListInsert函数使用户初始化线性表。然后调用函数操作， 操作结果用PrintList_Sq打印出线性表的内容 3.运行程序，完整代码见下： - 2 - //data struct 实验一 线性表基本操作1 #includestdio.h #includestdlib.h //#includealgorithm //using namespace std; #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define YES 1 #define NO 0 #define INFEASIBLE -1 #define OVERFLOW -2 typedef int Status; typedef int ElemType; #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 typedef struct { ElemType *elem; int length; int listsize; }SqList; Status cmp(ElemType a,ElemType b) { if(a==b) return YES; else return NO; } Status InitList_Sq(SqList L) {//构造空的顺序表La L.elem=(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType)); if(!L.elem)exit(OVERFLOW); L.length=0; L.listsize=LIST_INIT_SIZE; return OK; } Status Destroy_Sq(SqList L) {//撤销线性表L； free(L.elem); L.elem=NULL; L.length=0; L.listsize=0; - 3 - return OK; } Status ClearList_Sq(SqList L) {//清空线性表 L.length=0;//memset(L,0,sizeof(L)); return OK; } Status ListInsert_Sq(SqList L, int i, ElemType e) {// 在顺序线性表L的第i个元素之前插入新的元素e ElemType *p; if (i 1 || i L.length+1) return ERROR; if (L.length = L.listsize) { ElemType *newbase = (ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof (ElemType)); if (!newbase) return ERROR; L.elem = newbase; L.listsize += LISTINCREMENT; } ElemType *q = (L.elem[i-1]); for (p = (L.elem[L.length-1]); p=q; --p) *(p+1) = *p; *q = e; ++L.length; return OK; } Status ListDelete_Sq(SqList L, int i, ElemType e) { // 在顺序线性表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; } // ListDelete_Sq Status LocateElem_Sq(SqList L, ElemType e,Status (*compare)(ElemType, ElemType)) { // 在顺序线性表L中查找第1个值与e满足compare()的元素的位序 int i; ElemType *p; i = 1; p = L.elem; - 4 - while (i = L.length !(*compare)(*p++, e)) ++i; if (i = L.length) return i; else return 0; } void Print