4-2 顺序表操作集

本题要求实现顺序表的操作集。

函数接口定义：

List MakeEmpty(); 
Position Find( List L, ElementType X );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );

其中List结构定义如下：

typedef int Position;
typedef struct LNode *List;
struct LNode {
    ElementType Data[MAXSIZE];
    Position Last; /* 保存线性表中最后一个元素的位置 */
};

各个操作函数的定义为：

List MakeEmpty()：创建并返回一个空的线性表；

Position Find( List L, ElementType X )：返回线性表中X的位置。若找不到则返回ERROR；

bool Insert( List L, ElementType X, Position P )：将X插入在位置P并返回true。若空间已满，则打印“FULL”并返回false；如果参数P指向非法位置，则打印“ILLEGAL POSITION”并返回false；

bool Delete( List L, Position P )：将位置P的元素删除并返回true。若参数P指向非法位置，则打印“POSITION P EMPTY”（其中P是参数值）并返回false。

裁判测试程序样例：

#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.
", X);
    }
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        P = Find(L, X);
        if ( P == ERROR )
            printf("Finding Error: %d is not in.
", X);
        else
            printf("%d is at position %d.
", X, P);
    }
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &P);
        if ( Delete(L, P)==false )
            printf(" Deletion Error.
");
        if ( Insert(L, 0, P)==false )
            printf(" Insertion Error: 0 is not in.
");
    }
    return 0;
}

/* 你的代码将被嵌在这里 */

输入样例：

6
1 2 3 4 5 6
3
6 5 1
2
-1 6

输出样例：

FULL Insertion Error: 6 is not in.
Finding Error: 6 is not in.
5 is at position 0.
1 is at position 4.
POSITION -1 EMPTY Deletion Error.
FULL Insertion Error: 0 is not in.
POSITION 6 EMPTY Deletion Error.
FULL Insertion Error: 0 is not in.
答案：

List MakeEmpty()
{
    List tmpList = NULL;
    tmpList = (struct LNode*) malloc( sizeof(struct LNode));
    if(tmpList == NULL)
        return NULL;
    
    tmpList ->Last = 0;
        return tmpList;


};

Position Find(List L, ElementType X)
{
    int res = ERROR;
    int i = 0;
    if(L == NULL)
        return;
    while(i < MAXSIZE)
    {
        if(L ->Data[i] == X)
        {
            res = i;
            break;
        }
        i++;
    }

    return res;
};

bool Insert(List L, ElementType X, Position P)
{
    int tmpLast = L ->Last;
    bool res = true;
    if(L->Last >= MAXSIZE || L == NULL)
    {
        printf("FULL");
         res = false;
        goto End;
    }
    if(P < 0 || P > L ->Last )
    {
        printf("ILLEGAL POSITION");
        res = false;
        goto End;
    }
    if(P + 1 == MAXSIZE)
    {
        L ->Data[P] = X;
        (L ->Last)++;
    }    
    else
    {
        while(tmpLast > P)
        {
            L ->Data[tmpLast] = L ->Data[tmpLast -1];
            tmpLast--;
        }
        L ->Data[P] = X;
        (L ->Last)++;
    }
End:
    return res;
};

bool Delete(List L, Position P)
{
    bool res = true;
    if(P < 0 ||  P >= L->Last)
    {
        res = false;
        printf("POSITION %d EMPTY", P);
        goto End;
    }
    while(P < ( L ->Last -1 ))
    {
        L ->Data[P] = L ->Data[P + 1];
        P++;
    }
    (L ->Last)--;
End:
    return res;
};