<p><strong><span style="font-size:24px;color:#ff0000;">main.cpp:</span></strong></p>
<span style="font-size:18px;">#include<iostream> using namespace std; #include"list.h" int main() { ElemType e; SqList *sq; ElemType x[6]= {5,8,7,2,4,9}; CreateList(sq, x, 6); DispList(sq); cout<<ListLength(sq)<<endl; if(GetElem(sq,5,e))cout<<e<<endl; ListInsert(sq,1,1); DispList(sq); ListDelete(sq,1,e); DispList(sq); DestroyList(sq); DispList(sq); return 0; } </span>
<span style="color:#ff0000;"><strong><span style="font-size:18px;color:#000000;">list.cpp:</span></strong></span>
<pre class="html" name="code"><span style="font-size:18px;color:#000000;"></span>
<span style="font-size:18px;color:#000000;">#include <stdio.h> #include <malloc.h> #include "list.h" //用数组创建线性表 void CreateList(SqList *&L, ElemType a[], int n) { int i; L=(SqList *)malloc(sizeof(SqList)); for (i=0; i<n; i++) L->data[i]=a[i]; L->length=n; } //判定是否为空表ListEmpty(L) bool ListEmpty(SqList *L) { return(L->length==0); } //输出线性表DispList(L) void DispList(SqList *L) { int i; if (ListEmpty(L)) return; for (i=0; i<L->length; i++) printf("%d ",L->data[i]); printf("\n"); } //求线性表的长度ListLength(L) int ListLength(SqList *L) { return L->length; } //求某个数据元素值GetElem(L,i,e) bool GetElem(SqList *L,int i,ElemType &e) { if (i<1 || i>L->length) return false; e=L->data[i-1]; return true; } //按元素值查找LocateElem(L,e) int LocateElem(SqList *L, ElemType e) { int i=0; while (i<L->length && L->data[i]!=e) i++; if (i>=L->length) return 0; else return i+1; } //插入数据元素ListInsert(L,i,e) bool ListInsert(SqList *&L,int i,ElemType e) { int j; if (i<1 || i>L->length+1) return false; //参数错误时返回false i--; //将顺序表逻辑序号转化为物理序号 for (j=L->length; j>i; j--) //将data[i..n]元素后移一个位置 L->data[j]=L->data[j-1]; L->data[i]=e; //插入元素e L->length++; return true;//顺序表长度增1 //成功插入返回true } //删除数据元素ListDelete(L,i,e) bool ListDelete(SqList *&L,int i,ElemType e) { int j; if (i<1 || i>L->length) //参数错误时返回false return false; i--; //将顺序表逻辑序号转化为物理序号 e=L->data[i]; for (j=i; j<L->length-1; j++) //将data[i..n-1]元素前移 L->data[j]=L->data[j+1]; L->length--; //顺序表长度减1 return true; //成功删除返回true } //销毁线性表DestroyList(L) void DestroyList(SqList *&L) { free(L); } </span>
list.h:
<span style="font-size:18px;color:#000000;">#ifndef LIST_H_INCLUDED #define LIST_H_INCLUDED #define MaxSize 50 typedef int ElemType; typedef struct { ElemType data[MaxSize]; int length; } SqList; void CreateList(SqList *&L, ElemType a[], int n);//用数组创建线性表 void DestroyList(SqList *&L);//销毁线性表DestroyList(L) bool ListEmpty(SqList *L);//判定是否为空表ListEmpty(L) int ListLength(SqList *L);//求线性表的长度ListLength(L) void DispList(SqList *L);//输出线性表DispList(L) bool GetElem(SqList *L,int i,ElemType &e);//求某个数据元素值GetElem(L,i,e) int LocateElem(SqList *L, ElemType e);//按元素值查找LocateElem(L,e) bool ListInsert(SqList *&L,int i,ElemType e);//插入数据元素ListInsert(L,i,e) bool ListDelete(SqList *&L,int i,ElemType e);//删除数据元素ListDelete(L,i,e)#endif // LIST_H_INCLUDED #endif</span>
结果为:
<img src="https://img-blog.csdn.net/20150921163012599?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />