数据结构线性表.doc

#include#define MaxLen 50typedef int elemtype;typedef elemtype sqlistMaxLen;int create(sqlist A)int i,n;cout 创建一个顺序表 endl;cout n;for (i=0;in;i+)cout 输入第 i+1 Ai;return n;#include using namespace std;#define LIST_INIT_SIZE 100/线性表存储空间的初始分配量 #define LISTINCREMENT 10/线性表存储空间的分配增量typedef int ElemType;typedef int Status;#define OK 1#define OVERFLOW -1#define ERROR -2typedef struct/用户自定义结构体SqList ElemType *elem;/指针指向存储空间基址 int length; int listsize;SqList;/线性表初始化Status Initlist_Sq(SqList &L) L.elem=(ElemType * )malloc(LIST_INIT_SIZE*sizeof(ElemType); if(!L.elem) exit(OVERFLOW); L.length =0;/空表长度为0 L.listsize=LIST_INIT_SIZE; /初始存储容量 return OK;/Put 操作Status Put(SqList &L,int n) cout向线性表中输入这n个数据:endl; for(int i=0;iL.elemi; L.length =L.length +n; return OK; /Out 操作Status Out(SqList &L,int n) for(int i=0;in;i+) coutL.elemi ; coutendl; return OK;/Insert操作int *p,*q,*e;Status ListInsert_Sq(SqList &L,int i,ElemType e) ElemType *newbase; if(iL.length+1) return ERROR;/i的值不合法 if(L.length =L.listsize) /存储空间已满，增加分配 newbase=(ElemType*)realloc(L.elem, (L.listsize+LISTINCREMENT)*sizeof(ElemType); if(!newbase)exit(OVERFLOW);/重新分配失败 L.elem=newbase; L.listsize+=LISTINCREMENT;/增加分配容量q=&(L.elemi-1);/q为插入地址for(p=&(L.elemL.length-1);p=q;-p) *(p+1)=*p;/插入元素后移*q=e;+L.length;return OK;/Delete操作Status ListDelete_Sq(SqList &L,int i,ElemType &e)if(i=L.length) return ERROR;p=&(L.elemi-1);e=*p;q=L.elem+L.length-1;for (+p;p=q;+p) *(p-1)=*p;-L.length;return OK;/Search操作int LocateElem_Sq(SqList L,ElemType f) int i=1; p=L.elem; while(i=L.length)&!(*p+)=f) i+; if(i=L.length) return i; else return 0;/主函数int main() int n,i,k,e,j,f; SqList La; Initlist_Sq(La); cout线性表中的数据个数n(n=100):n; Put(La,n); cout该线性表为:endl; Out(La,n); cout对线性表进行插入操作，请依次输入插入位置i(第i个数据之前），插入数据k：ik; ListInsert_Sq(La,i,k); cout插入后的线性表为：endl; Out(La,La.length); cout进行删除操作,请输入删除位置j:j; ListDelete_Sq(La,j,e); cout删除之后的线性表：endl; Out(La,La.len