#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 5
#define ERROR -1
typedef enum {false, true} bool;
typedef int ElementType;
typedef int Position;
typedef struct LNode *List;
struct LNode {
ElementType Data[MAXSIZE];
Position Last; /* 保存线性表中最后一个元素的位置 */
};
List MakeEmpty(); //创建并返回一个空的线性表
Position Find( List L, ElementType X ); //返回线性表中X的位置。若找不到则返回ERROR
void Insert( List L, ElementType X, Position P ); //将X插入在位置P并返回ture
bool Delete( List L, Position P );//将位置P的元素删除并返回true。
int main()
{
List L;
ElementType X;
Position P;
int N;
L = MakeEmpty();
scanf("%d", &N);
while ( N-- ) {
scanf("%d", &X);
if ( Insert(L, X, 0)==false )
printf(" Insertion Error: %d is not in.\n", X);
}
scanf("%d", &N);
while ( N-- ) {
scanf("%d", &X);
P = Find(L, X);
if ( P == ERROR )
printf("Finding Error: %d is not in.\n", X);
else
printf("%d is at position %d.\n", X, P);
}
scanf("%d", &N);
while ( N-- ) {
scanf("%d", &P);
if ( Delete(L, P)==false )
printf(" Deletion Error.\n");
if ( Insert(L, 0, P)==false )
printf(" Insertion Error: 0 is not in.\n");
}
return 0;
}
List MakeEmpty()
{
ListPtrL;
PtrL = (List)malloc(sizeof(struct LNode));
PtrL->Last=-1;//Last 指最后一个元素的位置,线性表的长度是Last+1
return PtrL;
}
Position Find(List L,ElemType X){//查找x位置
int i=0;
while(i<L->Last && L->Data[i]!=x){
i++;
}
if(i>L->Last) return ERROR;
else return i;
}
void insert(List L,ElementType X,Postion P){
if(L->Last == MAXSIZE-1){
printf("FULL");
}
else if(P<0 || P>L->Last+1){
printf("ILLEGAL POSITION")
}4
else{
int i;
for(i=L->Last;i>=P;i--){
L->Data[i+1] = L->Data[i];
}
L->Data[P]=X;
L->Last++;
}
}
bool Delete( List L, Position P ){
if(P<0||P>L->Last){
printf("POSITION %d EMPTY",P);
return false;
}
int i;
for(i=P;i<L->Last;i++)
L->Data[i]=L->Data[i+1];
L->Last--;
return true;
}