第三周-项目2 建设“顺序表”算法库

list.h<pre name="code" class="cpp">#define MaxSize 50
typedef int ElemType;
typedef struct
{
ElemType data[MaxSize];
int length;
} SqList;
void CreateList(SqList *&L, ElemType a[], int n);//用数组创建线性表
void InitList(SqList *&L);//初始化线性表InitList(L)
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)

<pre name="code" class="cpp">#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;}//初始化线性表InitList(L)void InitList(SqList *&L)   //引用型指针{L=(SqList *)malloc(sizeof(SqList));//分配存放线性表的空间L->length=0;}//销毁线性表DestroyList(L)void DestroyList(SqList *&L){free(L);}//判定是否为空表ListEmpty(L)bool ListEmpty(SqList *L){return(L->length==0);}//求线性表的长度ListLength(L)int ListLength(SqList *L){return(L->length);}//输出线性表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");}//求某个数据元素值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;   //参数错误时返回falsei--;            //将顺序表逻辑序号转化为物理序号for (j=L->length; j>i; j--) //将data[i..n]元素后移一个位置L->data[j]=L->data[j-1];L->data[i]=e;           //插入元素eL->length++;            //顺序表长度增1return true;            //成功插入返回true}//删除数据元素ListDelete(L,i,e)bool ListDelete(SqList *&L,int i,ElemType &e){int j;if (i<1 || i>L->length)  //参数错误时返回falsereturn 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--;              //顺序表长度减1return true;              //成功删除返回true}  

<pre name="code" class="cpp">#include "list.h"int main(){SqList *sq;ElemType x[6]= {5,8,7,2,4,9};CreateList(sq, x, 6);DispList(sq);return 0;}