https://pintia.cn/problem-sets/15/problems/725

本題要求實現順序表的操作集。

函數接口定義：

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 )

裁判測試程序樣例：

#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;
}

/* 你的代碼將被嵌在這裏 */
 

輸入樣例：

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 tmp = (List)malloc(sizeof(struct LNode));
    tmp->Last = -1;
    return tmp;
}

Position Find( List L, ElementType X )
{
    for(int i=0;i<=L->Last;i++)
    {
        if(L->Data[i] == X)
            return i;        
    }
    return ERROR;
}

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

bool Delete( List L, Position P )
{
    if(P<0 || P>L->Last)
    {
        printf("POSITION %d EMPTY",P);
        return false;
    }
    else
    {
        for(int i=P;i<L->Last;i++)
        {
            L->Data[i] = L->Data[i+1];
        }
        L->Last--;
    }
    return true;
}

6-2 順序表操作集