typedef int ElemType;
typedef int Status;
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define TRUE 1
#define FLASE 0
#define ERROR 0
#define INFEASBILE -1
#include<stdio.h>
#include<math.h>
#include<malloc.h>
#include<iostream.h>
#include<stdlib.h>
#define OK 1
typedef struct {
ElemType *elem;
int length;
int listsize; } SqList;
Status InitList(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(SqList &L, int i, ElemType e)
{
ElemType *q,*p,*newbase;
if(i<1||i>L.length+1)return ERROR;
if(L.length>=L.listsize){
newbase=(ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));
if(!newbase)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;
return OK;
}
Status ListDelete(SqList &L,int i,ElemType &e)
{
ElemType *p,*q;
if((i<1||i>L.length)) return ERROR;
p=&(L.elem[i-1]);
e=*p;
q=L.elem+L.length-1;
for(p;p<=q;++p)
*(p-1)=*p;
--L.length;
return OK;
}//Listdelete
ListEmpty(SqList L)
{
if(L.length=0)return TRUE;
else return ERROR;
}
Status ClearList(SqList &L)
{
if(ListEmpty(L))free(&L);
return OK;
}
Status ListLength(SqList L)
{
int i;
i=L.length;
return i;
}
ElemType GetElem(SqList L, int i, ElemType &e)
{
if(i<1||i>L.length) return ERROR;
e=L.elem[i];
return e;
}
void main()
{
SqList L;
InitList(L);
printf("请输入线形表的长度");
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
printf("请输入第%d个值的元素:",i);
ElemType e;
scanf("%d",&e);
ListInsert(L,i,e);
}
int m;
printf("请输入你要选择的方法:");
cout<<"1.另开空间法"<<"2.原表法"<<endl;
scanf("%d",&m);
switch(m)
{
case 1:
SqList L1;
InitList(L1);
for(i;i<=n;i++)
{
ElemType e;
GetElem(L,i,e);
ListInsert(L1,(n-i),e) ;
}
case 2:
ElemType a,b;
for(i=1;i<=(n-1)/2;i++)
{
ElemType e;
a=GetElem(L,i,e);
b=GetElem(L,(n-i),e);
ListInsert(L,i,b);
ListInsert(L,i,a);
}
}
}