C++实现线性表的顺序存储与链式存储

实验一 线形表

一、 实验目的
掌握线性表的逻辑结构特性以及在计算机内的两种存储结构。
掌握线性表的基本操作在两种存储结构上的实现，其中以链表的操作为侧重点。
会灵活运用线性表结构解决某些实际问题。
二、 实验内容
1． 线性表顺序存储结构下基本操作的实现（初始化、赋值、取值、插入、删除、归并等）。
2． 线性表链式存储结构下基本操作的实现（初始化、建表、取值、插入、删除、归并等）。
3． 使用链式结构实现一元多项式表示及相加。

顺序表的源程序

#include <iostream>
using namespace std; 
#include <stdlib.h>
#include <process.h>
#define OK 1
#define ERROR 0
#define OVERFLOW -1
#define MAXSIZE 100
typedef int Status;
typedef int ElemType;
typedef struct {
	ElemType *elem;
	int length;

}SqList;
Status InitList(SqList &L)
{//构造一个空的顺序表L.
  //L.elem=(ElemType*)malloc(INITSIZE*sizeof(ElemType));
  L.elem=new ElemType[MAXSIZE];
  if(!L.elem)exit(OVERFLOW);
  L.length=0;
  
  return(OK);
}
void Assign(SqList &L)
{ //为顺序表L的各元素赋值.
  int i, N;
 cout<<"Please input the Number of the SqList:"<<endl;
 cin>>N;
 cout<<"Please input the elements:"<<endl;
  for(i=0;i<N;i++)
  { cin>>L.elem[i];
    L.length++;}
 }
 
 void ListTraverse(SqList L)
{//遍历序表顺L.
  int i;
  for(i=0;i<=L.length-1;i++)
  cout<<L.elem[i]<<"  ";
  cout<<endl;
  cout<<"the length is:"<<L.length<<endl;
 }
 Status GetELem(SqList L, int i, ElemType &e)
{//取顺序表L的第i个元素的值,用e返回.
  e=L.elem[i-1];
  return OK;
}
Status ListInsert(SqList &L, int i, ElemType e)
{ //在顺序表L的第i个元素前插入元素e.
  int j;
  if(i<1||i>L.length+1)return ERROR;
  if(L.length==MAXSIZE)  return ERROR;
  for(j=L.length-1;j>=i-1;j--)
	  L.elem[j+1]=L.elem[j];
  L.elem[i-1]=e;
  ++L.length;
  return OK;
}

Status ListDelete(SqList&L,int i)
{//在顺序表L中 删除第i个元素
if((i<1)||(i>L.length))return ERROR;
for(int j=i;j<=L.length-1;j++)
L.elem[j-1]=L.elem[j];
--L.length;
return OK; 
}
void MergeList(SqList La,SqList Lb, SqList &Lc)
{ //已知顺序表La和Lb的元素按值非递减排列,
  //归并La和Lb得到新的顺序表Lc,Lc的元素也按值非递减排列.
  ElemType *pa,*pb,*pc,*pa_last,*pb_last;
  pa=La.elem;
  pb=Lb.elem;
  Lc.length=La.length+Lb.length;
  pc=Lc.elem=new ElemType[Lc.length];
  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++;
  while(pb<=pb_last) *pc++=*pb++;
}


int main()
{   SqList L,L1,L2;
    int i,j;
	ElemType e,f;
    if(InitList(L))  cout<<"Init success\n"<<endl;
	Assign(L);//为顺序表L的各元素赋值.
//	ListTraverse(L);//遍历 顺序表L 
	cout<<"Plsese input the location i:"<<endl;
	cin>>i;
	GetELem(L,i,e);
	cout<<"The ith elem is"<<e<<endl; //输出第i个元素
	cout<<"Please input the Inserted elem's No. and the value:"<<endl;//输入要插入元素的位置与值 
	cin>>j>>f; 
	ListInsert(L,j,f);//插入元素 
	ListTraverse(L);
	cout<<"Please input the delete elem's No.";
	cin>>i;
	ListDelete(L,i);
	ListTraverse(L);
	InitList(L1);
	Assign(L1);
	ListTraverse(L1);
	MergeList(L,L1,L2);//归并L，L1 
	ListTraverse(L2);//遍历新列表	
	return 0;
	}

运行结果

链式存储源代码

#include<iostream>
using namespace std;
#include"stdio.h"
#include"process.h"
#include"malloc.h"
#define  TRUE     1
#define  FALSE    0
#define  OK       1
#define  ERROR    0
#define  OVERFLOW -2
#define ININSIZE  100
#define INCREMENT  10
typedef int Status;
typedef int ElemType;                   

typedef struct LNode
{  
ElemType  data;
struct LNode   *next;
}LNode,*LinkList;
void ListTraverse(LinkList L)
{//遍历链式表l
LinkList p=L->next;
while(p!=NULL)
{printf("%d\n",p->data);
p=p->next;}
}
void CreatList(LinkList &L,int n)//建表 
{//逆位序输入个元素的值，建立带表头节点的单链表l
int i;LinkList p;
L=(LinkList)malloc(sizeof(LNode));                  
L->next=NULL;
for(i=n;i>0;--i)
{  p=(LinkList)malloc(sizeof(LNode));
p->data=i;
p->next = L->next;L->next = p;
}
}//creatlist
Status GetElem(LinkList L,int i,ElemType &e)//单链表的取值 
{//取带头节点的单链表l中第i个元素，用e返回
int j;LinkList p;
p=L->next;j=1;
while(p&&j<i)
{
p=p->next;++j;
}
if(!p||j>i)return ERROR;
e=p->data;
return OK;
}//getelem
Status ListInsert(LinkList &L,int i,ElemType e)//单链表的插入 
{ //在带头节点的单链表L中第i个位置前插入元素e
LinkList p,s;
int j=0;p=L->next;
while(p&&j<i-2) {p=p->next;++j;}
if(!p||j>i-1)return ERROR;
s=(LinkList)malloc(sizeof(LNode));
s->data=e;s->next=p->next;
p->next=s;
return OK;
}//listinsert

Status ListDelete(LinkList &L,int i)//单链表的删除 
{//在带头节点的单链表L中,删除第i个元素 
LinkList p,q;
p=L;
int j=0;
while((p->next)&&(j<i-1))
{p=p->next;++j;
 } 
 if(!(p->next)|(j>i-1)) return ERROR;
 q=p->next;
 p->next=q->next;
 delete q;
 return OK;
}
void MergeList(LinkList &La,LinkList &Lb,LinkList &Lc)//单链表的归并 
{	LinkList pa=La->next;
	LinkList pb=Lb->next;
	Lc=La;
	LinkList pc=Lc;
	while(pa&&pb){
		if(pa->data<=pb->data)
		{
			pc->next=pa;
			pc=pa;
			pa=pa->next;
		}
		else 
		{
			pc->next=pb;
			pc=pb;
			pb=pb->next;
		}	
	} 
	pc->next=pa?pa:pb;
	delete Lb; 
}
int main()
{  LinkList L,L1,L2;
int i,e,j,f;int n;
printf("请输入节点个数：");
scanf("%d",&n);
CreatList(L, n);
printf("建表成功！\n");
ListTraverse(L);
printf("please input the location i:");
scanf("%d",&i);
GetElem(L,i,e);
printf("the i th elem is %d\n",e);
printf("please input the inserted elem's num and the value: ");
scanf("%d %d",&j,&f);
ListInsert(L,j,f);
ListTraverse( L); 
cout<<"please input the delete elem's num"<<endl;
cin>>i;
ListDelete(L,i);
ListTraverse(L);
cout<<"删除成功!n"<<endl;
printf("请输入节点个数：");
scanf("%d",&n);
CreatList(L, n);
printf("建表成功！\n");
ListTraverse(L);
MergeList(L,L1,L2);
printf("归并之后的单链表为：\n");
MergeList(L,L1,L2);
return 0;
}

运行结果