/*顺序表的相关定义及操作,重点掌握查找,插入以及删除操作及其时间复杂度*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
using namespace std;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define MaxSize 100
typedef int ElemType;
typedef int status;
typedef struct{
ElemType *elem;
int length;
}SqList;
//初始化一个空的线性表
status InitSqList(SqList &L){
L.elem = new ElemType[MaxSize];
if(!L.elem)
exit(OVERFLOW);
L.length=0;
return OK;
}
//销毁一个线性表
status DestorySqList(SqList &L){
//判断是否分配了内存
if(L.elem)
//释放存储空间
delete(L.elem);
}
//清空线性表
status ClearSqList(SqList &L){
L.length=0;
}
//求线性表的长度
status GetLength(SqList L){
return L.length;
}
//判断线性表是否为空
status IsEmpty(SqList L){
if (L.length==0)
return 1;
else
return 0;
}
//顺序表取值
status GetElem(SqList L,int i,ElemType &e){
if(i>0&&i<=L.length){
e=L.elem[i-1];
return OK;
}
else
return ERROR;
}
//向线性表中加入j个数据(建立顺序表)
void add_num(SqList &L,int j){
for(int i = 0;i<j;i++){
cout<<"请输入要加入的元素:";
cin>>L.elem[i];
L.length++;
}
}
//输出线性表的元素
void show(SqList L){
for(int i=0;i<L.length;i++){
printf("%d\n",L.elem[i]);
}
}
//查找线性表中首个值为e的位置,未找到则返回0
status LocaltElem(SqList L, ElemType e){
if(L.elem){
for(int i=0;i<L.length;i++){
if(L.elem[i]==e) {
return i+1;
}
}
return 0;
}
}
//线性表中插入元素
status InsertList(SqList &L,int i,ElemType e){
if(i<1||i>L.length+1) return ERROR;
if(L.length==MaxSize) return ERROR;
for(int j=L.length;j>=i;j--)
L.elem[j]=L.elem[j-1];
L.elem[i-1]=e;
L.length++;
return OK;
}
//删除线性表中的元素
status DeleteList(SqList &L,int 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 UnionSqList(SqList &La,SqList Lb){
int LaLength=GetLength(La);
int LbLength=GetLength(Lb);
int e;
for(int i=1;i<=LbLength;i++){
GetElem(Lb,i,e);
if(!LocaltElem(La,e)) InsertList(La,++LaLength,e);
}
}
//有序表的合并(用顺序表实现)
void MergeSqList(SqList La,SqList Lb,SqList &Lc){
int LaLength=GetLength(La);
int LbLength=GetLength(Lb);
int LcLength=LaLength+LbLength;
Lc.elem = new ElemType[LcLength];
if(!Lc.elem)
exit(OVERFLOW);
Lc.length=LcLength;
int i=0;
int j=0;
int k=0;
while(i<LaLength&&j<LbLength){
if(La.elem[i]<Lb.elem[j]){
Lc.elem[k]=La.elem[i];
i++;
}
else{
Lc.elem[k]=Lb.elem[j];
j++;
}
k++;
}
while(i<LaLength){
Lc.elem[k]=La.elem[i];
i++;
k++;
}
while(j<LbLength){
Lc.elem[k]=Lb.elem[j];
j++;
k++;
}
}
//改进的有序表的合并(用顺序表实现)
void MergeSqList_Impro(SqList La,SqList Lb,SqList &Lc){
int LaLength=GetLength(La);
int LbLength=GetLength(Lb);
int LcLength=LaLength+LbLength;
Lc.elem = new ElemType[LcLength];
if(!Lc.elem) exit(OVERFLOW);
Lc.length=LcLength;
ElemType *pa=La.elem;
ElemType *pb=Lb.elem;
ElemType *pc=Lc.elem;
ElemType *pa_last=pa+La.length-1;
ElemType *pb_last=pb+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 La,Lb,Lc;
InitSqList(La);
InitSqList(Lb);
add_num(La,3);
add_num(Lb,5);
//UnionSqList(La,Lb);
//show(La);
//show(Lb);
//MergeSqList(La,Lb,Lc);
MergeSqList_Impro(La,Lb,Lc);
show(Lc);
//show(Lb);
//int e=3;
//向线性表中插入元素
//add_num(S);
//输出线性表的元素
//show(S);
//查找线性表中首个值为e的位置
//int loc=LocaltElem(S,e);
//printf("元素%d在线性表中首次出现的位置是%d",e,loc);
return 0;
}