Shunxubiao.zip_C语言

#include "Common.h" #include "SqList.h" //1、初始化 Status InitList(Sqlist&L) { L.elem=((ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType))); if(!L.elem) return ERROR; L.length=0; L.listsize= LIST_INIT_SIZE; return OK; } //2、销毁 void Destorylist(Sqlist&L) { if(L.elem) free(L.elem); L.elem=NULL; } //3、清空 void ClearList(Sqlist &L) { L.length=0; } //4、判空 Status EmptyList(Sqlist L) { if(L.length==0) return TURE; else return FALSE; } //5、求表长 Status LengthList(Sqlist L) { return L.length; } //6、取元素 Status GetElem(Sqlist L, int i, ElemType &e) { if(i<1||i>L.length) return ERROR; else return e=L.elem[i-1]; } // 7、定位操作 int LocateElem(Sqlist L, ElemType e) { int i=0; for (i = 0; i < (L.length - 1); i++) { if(e==L.elem[i]) return i+1; } return i; } //8、求前驱 Status PriorElem(Sqlist L, ElemType pur_e, ElemType pre_e) { int i; ElemType *p,*q; p=&L.elem[0]; for (i = 1; i < L.length - 1; i++) { if(pur_e==L.elem[i]) { p=&L.elem[i]; break; } } q=p-1; pre_e=*q; return pre_e; } //9、求后继 Status NextElem(Sqlist L, ElemType pur_e, ElemType next_e) { int i; ElemType *p,*q; p=&L.elem[0]; for (i = 0; i < L.length - 2; i++) { if (pur_e == L.elem[i]) { p=&L.elem[i]; break; } } q=p+1; next_e=*q; return next_e; } //10、插入 Status InsertElem(Sqlist L, int i, ElemType e) { ElemType *p,*q; if(i<1||i>L.length) return ERROR; if (L.length == L.listsize) { L.elem=((ElemType*)realloc(L.elem,(LIST_INIT_SIZE+ LISTINCREMENT)*sizeof(ElemType))); L.listsize= LIST_INIT_SIZE + LISTINCREMENT; } q=&L.elem[i-1]; for (p = &L.elem[L.length - 1]; p > q; p--) *(p+1)=*p; *(q+1)=e; L.length++; return e; } //11、删除 Status DeleteElem(Sqlist &L, int i, ElemType e) { ElemType *p,*q; if(!L.elem) return ERROR; if(i<1||i>L.length) return ERROR; q=&L.elem[i-1]; e=*q; for (p = &L.elem[i - 1]; p <&L.elem[L.length - 1]; ++p) { * p=*(p+1); } L.length--; return e; } //12、遍历 void TraverList(Sqlist L) { int i; for (i = 0; i < L.length; i++) printf("%5d",L.elem[i]); } //14、比较 Status CompareList(Sqlist L, ElemType e1, ElemType e2) { if(e1>e2||e2==e2) return TURE; else return FALSE; }