Pat顺序表操作集

裁判程序如下：

#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 );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );

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()
{
    List L;
    L=(List)malloc(sizeof(struct LNode));
    L->Last=-1;//last指向最后一个值
    return L;
}
Position Find( List L, ElementType X )
{
    Position i=0;
    while(i<=L->Last&&L->Data[i]!=X)//寻找X的位置
      i++;
    if(i>L->Last)
	  return ERROR;
	else
	  return i;    
}
bool Insert( List L, ElementType X, Position P )
{
    Position i;
	if(L->Last==MAXSIZE-1)//数组已满
    {
        printf("FULL");
        return false;
    }
    if(P<0||P>L->Last+1)//插入位置非法
    {
        printf("ILLEGAL POSITION");
        return false;
    }
    for(i=L->Last;i>=P;i--)//将P及之后的位置后移为X留出空间
    {
        L->Data[i+1]=L->Data[i];
    }
    L->Data[P]=X;
    L->Last++;
    return true;      
}
bool Delete( List L, Position P )
{
    int i;
    if((P<0)||(P>L->Last))//P的位置非法
    {
        printf("POSITION %d EMPTY",P);
        return false;
    }
    for(i=P;i<=L->Last;i++)
        L->Data[i-1]=L->Data[i];
    L->Last--;
    return true;
}