1、 运行样例程序,理解静态分配顺序存储结构的线性表的下列基本操作。
(1)初始化顺序表 (2)创建顺序表 (3)判断空表 (4)求顺序表长度
(5)输出顺序表 (6)取顺序表位置 i 的元素值 (7)在顺序表中查找值为 e 的元素位置
(8)向顺序表中插入一个元素 (9)从顺序表中删除一个元素
2、采用书上第 22 页定义的线性表动态分配顺序存储结构,编程实现书中算法 2.3、算法 2.4 和算法 2.5。
例题一:
#include <stdio.h>
#define MaxSize 50
typedef int ElemType;
typedef struct
{
ElemType data[MaxSize];//存放顺序表元素//
int length;//存放数据表长度
}SqList;
void InitList(SqList &L)
{
L.length=0;
}
void CreateList(SqList &L,int n)
{
int i;
printf("输入%d个元素: \n",n);
for(i=0;i<n;i++)
scanf("%d",&L.data[i]);
printf("\n");
L.length=n;
}
int ListEmpty(SqList L)
{
return (L.length==0);
}
int ListLength(SqList L)
{
return (L.length);
}
void DispList(SqList L)
{
int i;
if(L.length==0)return;
for(i=0;i<L.length;i++)
printf("%d",L.data[i]);
printf("\n");
}
int GetElem(SqList L,int i,ElemType &e)
{
if(i<1||i>L.length)
return 0;
e=L.data[i-1];
return 1;
}
int LocateElem(SqList L,ElemType e)
{
int i=1;
while(i<=L.length&&L.data[i-1]!=e)i++;
if(i<=L.length)
return i;
else
return 0;
}
int ListInsert(SqList &L,int i,ElemType e)
{
int j;
if(i<1||i>L.length+1)return 0;
for(j=L.length-1;j>=i-1;j--)
L.data[j+1]=L.data[j];
L.data[i-1]=e;
++L.length;
return 1;
}
int ListDelete(SqList &L,int i,ElemType &e)
{
int j;
if(i<1||i>L.length)return 0;
e=L.data[i-1];
for(j=i-1;j<L.length;j++)
L.data[j]=L.data[j+1];
--L.length;
return 1;
}
int main()
{
ElemType dd,a,b;
SqList L;
InitList(L);
if(ListEmpty(L))
printf("顺序表为空!\n");
printf("创建顺序表!\n");
CreateList(L,5);
printf("输出顺序表所有元素!\n");
DispList(L);
printf("输出顺序表长度!\n");
printf("ListLength(L)=%d\n",ListLength(L));
printf("判断顺序表是否为空!\n");
printf("ListEmpty(L)=%d\n",ListEmpty(L));
printf("输出顺序表第三个位置元素到dd!\n");
GetElem(L,3,dd);
printf("查找元素a:");
scanf("%d",&a);
printf("元素%d在顺序表的位置为:%d\n",a,LocateElem(L,a));
printf("插入元素b:\n");
scanf("%d",&b);
printf("在顺序表第4个位置插入%d!\n",b);
ListInsert(L,4,b);
printf("输出插入操作后顺序表所有元素!\n");
DispList(L);
printf("删除顺序表第三个位置的元素!\n");
ListDelete(L,3,dd);
printf("输出删除操作后顺序表所有元素!\n");
DispList(L);
}
例题二:
#include <iostream>
using namespace std;
#include <stdlib.h>
#include<math.h>
#include <string.h>
#define LIST_INIT_SIZE 100// 线性表存储空间的初始分配量//
#define LISTINCREMENT 10//线性表存储空间的分配增量//
#define TRUE 1
#define OVERFLOW -2
#define ERROR 0
#define OK 1
typedef int Status;
typedef int ElemType;
typedef struct {
ElemType* elem;
int length;
int listsize;
}SqList;
Status InitList_Sq(SqList& L) {
//构造一个空的线性表L
L.elem = (ElemType*)malloc(LIST_INIT_SIZE * sizeof(ElemType));
if (!L.elem) {
printf("存储空间分配失败\n"); exit(OVERFLOW);
}
L.length = 0;
L.listsize = LIST_INIT_SIZE;
printf("空创建线性表成功!\n");
return OK;
}//InitList_Sq
Status ValueList_Sq(SqList& L) {
int i, j;
printf("请输入线性表元素的个数:");
cin >> i;
if (i > L.listsize) //如果当要输入的元素个数大于内存大小时
{
while (1) //一直开辟新空间,直到开辟的空间大于需要的空间为止
{
if (i > L.listsize) {
L.elem = (ElemType*)realloc(L.elem, LISTINCREMENT * sizeof(ElemType));
L.listsize += LISTINCREMENT;
}
else
break;
}
}
for (j = 0; j < i; j++) {
printf("请输入第%d个元素:", j + 1);
cin >> L.elem[j];
}
L.length = i; //赋值完成后,修改并保存线性表的长度
printf("赋值成功\n");
cout << "新的顺序表:";
return OK;
}
void DispList(SqList L)
{
int i;
if (L.length == 0) return;
for (i = 0; i < L.length; i++)
printf("%d ", L.elem[i]);
printf("\n");
}
Status ListInsert_Sq(SqList& L, int i, ElemType e) {
ElemType* newbase;
int * q,* p;
//在顺序线性表:中第i个位置之前插入新的元素e,
//i的合法值为1<=ListLength_Sq(L)+1
if (i<1 || i>L.length + 1)return ERROR;//i值不合法
if (L.length >= L.listsize) {//当前存储空间已满,增加分配
newbase = (ElemType*)realloc(L.elem,
(L.listsize + LISTINCREMENT) * sizeof(ElemType));
if (!newbase) {
printf("存储空间分配失败\n"); exit(OVERFLOW);
}//存储分配失败
L.elem = newbase;//新基址
L.listsize += LISTINCREMENT; //增加存储容量
}
q = &(L.elem[i - 1]);
for (p = &(L.elem[L.length - 1]); p >= q; --p)*(p + 1) = *p;//插入位置及之后的元素右移
*q = e;
++L.length;
printf("已经成功插入新数据\n");
printf("新的顺序表:\n");
DispList(L);
return OK;
}//ListInsert_Sq
Status ListDelete_Sq
(SqList& L, int i, ElemType& e)
{
int* q, * p;
if (i<1 || i>L.length)return ERROR;//i值不合法
p = &(L.elem[i - 1]);
e = *p;
q = L.elem + L.length-1;
for (++p; p <= q; ++p)
*(p - 1) = *p;
--L.length;
printf("已经成功删除旧数据\n");
printf("新的顺序表:\n");
DispList(L);
return OK;
}
void main()
{
SqList L;
InitList_Sq(L);
ValueList_Sq(L);
DispList(L);
int data;
int pos;
cout << "请输入需要插入的新数据:\n";
cin >> data;
cout << "请输入需要插入元素的位置\n";
cin >>pos;
ListInsert_Sq(L, pos, data);
cout << "请输入需要删除的旧数据:\n";
cin >> data;
cout << "请输入需要删除元素的位置\n";
cin >> pos;
ListDelete_Sq(L, pos, data);
return;
}
例题3:
#include <iostream>
using namespace std;
#include <stdlib.h>
#include<math.h>
#include <string.h>
#include <malloc.h>
#define LIST_INIT_SIZE 100// 线性表存储空间的初始分配量//
#define LISTINCREMENT 10//线性表存储空间的分配增量//
#define TRUE 1
#define OVERFLOW -2
#define ERROR 0
#define OK 1
typedef int Status;
typedef int ElemType;
typedef struct {
ElemType* elem;
int length;
int listsize;
}SqList;
Status InitList_Sq(SqList& L) {
//构造一个空的线性表L
L.elem = (ElemType*)malloc(LIST_INIT_SIZE * sizeof(ElemType));
if (!L.elem) {
printf("存储空间分配失败\n"); exit(OVERFLOW);
}
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}//InitList_Sq
Status ValueList_Sq(SqList& L) {
int i, j;
printf("请输入线性表元素的个数:");
cin >> i;
if (i > L.listsize) //如果当要输入的元素个数大于内存大小时
{
while (1) //一直开辟新空间,直到开辟的空间大于需要的空间为止
{
if (i > L.listsize) {
L.elem = (ElemType*)realloc(L.elem, LISTINCREMENT * sizeof(ElemType));
L.listsize += LISTINCREMENT;
}
else
break;
}
}
for (j = 0; j < i; j++) {
printf("请输入第%d个元素:", j + 1);
cin >> L.elem[j];
}
L.length = i; //赋值完成后,修改并保存线性表的长度
printf("赋值成功\n");
return OK;
}
void DispList(SqList L)
{
int i;
if (L.length == 0) return;
for (i = 0; i < L.length; i++)
printf("%d ", L.elem[i]);
printf("\n");
}
void MergeList_Sq(SqList La, SqList Lb, SqList& Lc)
{
int * pa;
int * pb;
int * pc;
int* pa_last, * pb_last;
//已经顺序线性表La和Lb的元素按值非递减排列
//归并La,Lb得到的新的顺序线性表Lc,Lc的元素也按值非递减排列
pa = La.elem; pb = Lb.elem;
Lc.listsize = Lc.length = La.length + Lb.length;
pc=Lc.elem=(ElemType*)malloc(Lc.listsize * sizeof(ElemType));
if (!Lc.elem)exit(OVERFLOW);//存储分配失败
pa_last = La.elem + La.length - 1;
pb_last = Lb.elem + Lb.length - 1;
while (pa <=pa_last && pb <=pb_last) {//归并
if (*pa <= *pb) *pc++ = *pa++;
else *pc++ = *pb++;
}
while (pa <= pa_last)*pc++ = *pa++;//插入La剩余的元素
while (pb <= pb_last)*pc++ = *pb++;//插入Lb剩余的元素
}//MergeList.Sq
void main()
{
SqList La;
SqList Lb;
SqList Lc;
int data;
int pos;
InitList_Sq(La);
printf("空创建线性表La成功!\n");
InitList_Sq(Lb);
printf("空创建线性表Lb成功!\n");
InitList_Sq(Lc);
printf("空创建线性表Lc成功!\n");
cout << "请具体搭建顺序线性表La\n";
ValueList_Sq(La);
cout << "顺序线性表La:";
DispList(La);
cout << "请具体搭建顺序线性表Lb\n";
ValueList_Sq(Lb);
cout << "顺序线性表Lb:";
DispList(Lb);
cout << "合并后的顺序表Lc:";
MergeList_Sq(La, Lb, Lc);
DispList(Lc);
return;
}