#include<stdio.h>
#include<stdlib.h>
#define OVERFLOW 0
#define ERROR 0
#define OK 1
#define LIST_INIT_SIZE 10
#define LISTINCREMENT 10
typedef int Status;
typedef int ElemType;
typedef struct{
ElemType *elem;
int length;
int listsize;
}SqList;
Status InitList_Sq(SqList &L){
L.elem =(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));
if(!L.elem ) exit(OVERFLOW);
L.length =0;
L.listsize=LIST_INIT_SIZE;
return OK;
}
Status ListInsert_Sq(SqList &L,int i,ElemType e){
if(i<1||i>L.length+1){
printf("插入时位置不合法\n");
return ERROR;
}
if(L.length>=L.listsize){
ElemType *newbase=(ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));
if(!newbase){
exit(OVERFLOW);
}
L.elem=newbase;
L.listsize+=LISTINCREMENT;
}
ElemType *q=&L.elem[i-1];
for(ElemType *p=&L.elem[L.length-1];p>=q;--p){
*(p+1)=*p;
}
*q=e;
++L.length;
printf("插入后顺序表为:\n");
for(int i=0;i<L.length;i++){
printf("%d ",L.elem[i]);
}
return OK;
}
Status ListDelete_Sq(SqList &L,int i,ElemType &e){
if(i<1||i>L.length){
printf("删除时位置不合法\n");
return ERROR;
}
ElemType *p=&(L.elem[i-1]);
e=*p;
printf("\n被删除的是%d\n",e);
ElemType *q=L.elem+L.length-1;
for(++p;p<=q;++p){
*(p-1)=*p;
}
--L.length;
printf("\n删除后顺序表为:\n");
for(int i=0;i<L.length;i++){
printf("%d ",L.elem[i]);
}
return OK;
}
Status MergeList_Sq(SqList &La,SqList &Lb){
if(La.elem==NULL||Lb.elem==NULL) {
return ERROR;
}
La.elem=(ElemType *)realloc(La.elem,(La.length+Lb.length)*sizeof(ElemType));
if(!La.elem||!Lb.elem) exit(OVERFLOW);
La.listsize=La.length+Lb.length;
for(int i=0,j=0;j<Lb.length; ){
if(La.elem[La.length-1-i]>Lb.elem[Lb.length-1-j]&&La.length-1-i>-1){
La.elem[La.listsize-1-i-j]=La.elem[La.length-1-i];
i++;
}
else{
La.elem[La.listsize-1-i-j]=Lb.elem[Lb.length-1-j];
j++;
}
}
La.length=La.length+Lb.length;
printf("\n合并后顺序表为:\n");
for(int i=0;i<La.length;i++){
printf("%d ",La.elem[i]);
}
return OK;
}
int main(){
printf("\n----------------------------初始化操作---------------------------------\n");
SqList L;
InitList_Sq(L);
for(int i=0;i<LIST_INIT_SIZE;i++){
L.elem[i]=i;
L.length++;
}
printf("线性表Sqlist初始化成功\n\n");
printf("初始化为:\n");
for(int i=0;i<L.length;i++){
printf("%d ",L.elem[i]);
}
printf("\n");
printf("\n----------------------------插入操作-----------------------------------\n");
ListInsert_Sq(L,2,666);
printf("\n----------------------------删除操作-----------------------------------\n");
ElemType s;
ListDelete_Sq(L,5,s);
printf("\n----------------------------合并操作-----------------------------------\n");
SqList La,Lb;
InitList_Sq(La);
InitList_Sq(Lb);
for(int i=0;i<LIST_INIT_SIZE;i++){
La.elem[i]=i*2+1;
La.length++;
}
for(int i=0;i<LIST_INIT_SIZE;i++){
Lb.elem[i]=i*2;
Lb.length++;
}
printf("两表分别初始化为:\n");
for(int i=0;i<La.length;i++){
printf("%d ",La.elem[i]);
}
printf("\n");
for(int i=0;i<Lb.length;i++){
printf("%d ",Lb.elem[i]);
}
printf("\n");
MergeList_Sq(La,Lb);
printf("\n");
system("pause");
return 0;
}
|