线性表顺序存储.doc

#include stdafx.h#includestdio.h #include stdlib.h #include io.h #include math.h #include time.h#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20typedef int Status;typedef int ElemType;typedef structElemType dataMAXSIZE;int length;SqList;int _tmain(int argc, _TCHAR* argv)return 0;Status visit(ElemType c) printf(%d ,c); return OK;Status InitList(SqList *L)L-length=0;return OK;Status ClearList(SqList *L)if (L-length!=0)L-length=0;return OK;else return ERROR;Status ListEmpty(SqList L)if (L.length!=0)return FALSE;else return TRUE;Status ListLength(SqList L)return L.length;Status GetElem(SqList L,int i,ElemType *e)if (L.length=0)return ERROR;if (1=i)&(i=ListLength(L)*e=L.datai-1;return OK;else return ERROR;Status LocateElem(SqList L,ElemType e) if (L.length=0)return 0;else int a;for(a=0;aL.length;a+)if(L.dataa=e)return a+1;break;Status ListInsert(SqList &L,int i,ElemType e) if(L.length=0)return ERROR;if(1=i)&(i=i;a-)L.dataa=L.dataa-1;L.datai-1=e;L.length+;return OK;else return ERROR;Status ListDelete(SqList *L,int i,ElemType *e) if(L-length=0)return ERROR;if(1=i)&(ilength)*e=L-datai-1;int a;for(a=i;alength;a+)L-dataa-1=L-dataa;L-length-;else return ERROR;Status ListTraverse(SqList L)int i; for(i=0;iL.length;i+) visit(L.datai); printf(n); return OK;int main()SqList L;ElemType e;Status i; int j,k;ElemType t; i=InitList(&L);printf(初始化L完毕,请输入顺序表的元素个数：n);scanf(%d,&j);L.length=j;printf(请输入%d个元素：n,j); for(k=0;kj;k+)scanf(%d,&t);L.datak=t; printf(在L中输入元素后，L中元素分别为：n); ListTraverse(L); printf(L的长度是：%d n,L.length); i=ListEmpty(L); if(i=0)printf(L是空的n);else printf(L不是空的n); i=ClearList(&L); printf(清空L后，L的长度为%dn,L.length); i=ListEmpty(L); if(i=1)printf(L是空的n);else printf(L不是空的n); i=InitList(&L);printf(初始化L完毕,请输入顺序表的元素个数：n);scanf(%d,&j);L.length=j;printf(请输入%d个元素：n,j); for(k=0;kj;k+)scanf(%d,&t);L.datak=t; printf(在L中输入元素后，L中元素分别为：n); ListTraverse(L); printf(L的长度是：%d n,L.length); printf(在什么位置插入元素？n);scanf(%d,&j);printf(插入什么元素？n);scanf(%d,&k);ListInsert(L,j,k); printf(在L的第%d位插入%d后，L中元素为：n,j,k); ListTraverse(L); printf(L的长度为：%d n,L.length); printf(想获取第几个元素？n);scanf(%d,&j);GetElem(L,j,&e); printf(第%d个元素的值为：%dn,j,e); printf(想找和哪个数值一样的元素？n);scanf(%d,&j); k=LocateElem(L,j); if(k) printf(第%d个元素的值为%dn,k,j); else printf(没有值为%d的元素n,j); k=ListLength(L); printf(想删除第几个元素？n);scanf(%d,&j);i=ListDelete(&L,j,&e); if(i=ERROR) pr