数据结构_线性表的顺序表示与实现.docVIP

数据结构 线性表的顺序表示与实现 C语言 主函数(func2-2实现在下面) #include stdio.h #include malloc.h #include stdlib.h typedef int Status; typedef int ElemType; #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define LIST_INIT_SIZE 100 #define LIST_INCREMENT 10 #define N 10 typedef struct { ElemType *elem;//elem为指针变量，存储的是顺序表L的基地址 int length; int listsize; }Sqlist; //func2-2函数调用声明 void print1(ElemType e); Status equal(ElemType e1,ElemType e2); //本文件函数声明 void InitSqlist_Sq(Sqlist L); void Destroy_Sq(Sqlist L); void Clear_Sq(Sqlist L); Status ListEmpty_Sq(Sqlist L); int ListLength_Sq(Sqlist L); Status GetElem_Sq(Sqlist L,int i,ElemType e); int Locate_Sq(Sqlist L,ElemType e,Status (* compare)(ElemType,ElemType));//compare()函数 Status PriorElem_Sq(Sqlist L,ElemType cur_e,ElemType pre_e); Status NextElem_Sq(Sqlist L,ElemType cur_e,ElemType next_e); Status ListInsert_Sq(Sqlist L,int i,ElemType e); Status ListDelete_Sq(Sqlist L,int i,ElemType e); Status ListTraverse_Sq(Sqlist L,void(* visit)(ElemType e)); //主函数 int main() { Sqlist L; int e,e1,i,j,k,m,pre_e,next_e,ins_e,del_e; //Status flag; InitSqlist_Sq(L); printf(初始化L表后，L.length = %d, L.listsize = %d, L.elem = %p\n,L.length,L.listsize,L.elem);//%p用于输出L.elem在内存中的地址 for(i = 1; i = N; i++) ListInsert_Sq(L,1,i); printf(L表中的元素为:); ListTraverse_Sq(L,print1); printf(请输入需要查询L表中第j个元素(1=j=%d):,L.length); scanf(%d,j); while(j1 || jL.length) { printf(超出范围！请重新输入！\n); printf(请输入需要查询L表中第j个元素(1=j=%d):,L.length); scanf(%d,j); } GetElem_Sq(L,j,e); printf(L表中第%d个元素的值为：%d\n,j,e); printf(查询L表中第几个元素的前一个元素[2,%d]:,L.length); scanf(%d,j); while(j2 || jL.length) { printf(超出范围！请重新输入！\n); printf(查询L表中第几个元素的前一个元素[2,%d]:,L.length); scanf(%d,j); } GetElem_Sq(L,j,e); PriorElem_Sq(L,e,pre_e); printf(第%d个元素为%d，它的前一个元素是：%d\n,j,e,pre_e); printf(查询L表中第几个元素的后一个元素[1,%d]:,L.length-1); scan