6-5 链式表操作集 (20 分)

最新推荐文章于 2021-08-16 17:12:21 发布

eesujie

最新推荐文章于 2021-08-16 17:12:21 发布

阅读量116

点赞数

分类专栏： PTA

本文链接：https://blog.csdn.net/qq_53194893/article/details/113796776

版权

PTA 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

该博客主要介绍了如何实现链式表的操作，包括查找、插入和删除元素。提供的C语言代码示例展示了这些操作，并进行了错误处理，如非法位置插入和删除的情况。此外，还包含了对输入样例的处理和输出样例的展示，以验证函数的正确性。

摘要由CSDN通过智能技术生成

6-5 链式表操作集 (20 分)

本题要求实现链式表的操作集。

函数接口定义：

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

其中List结构定义如下：

typedef struct LNode *PtrToLNode;
struct LNode {
    ElementType Data;
    PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;

各个操作函数的定义为：
Position Find( List L, ElementType X ):
返回线性表中首次出现X的位置。若找不到则返回ERROR；
List Insert( List L, ElementType X, Position P ):
将X插入在位置P指向的结点之前，返回链表的表头。如果参数P指向非法位置，则打印“Wrong Position for Insertion”，返回ERROR；
List Delete( List L, Position P )
:将位置P的元素删除并返回链表的表头。若参数P指向非法位置，则打印“Wrong Position for Deletion”并返回ERROR。

裁判测试程序样例：

#include <stdio.h>
#include <stdlib.h>

#define ERROR NULL
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
    ElementType Data;
    PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;

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

int main()
{
    List L;
    ElementType X;
    Position P, tmp;
    int N;

    L = NULL;
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        L = Insert(L, X, L);
        if ( L==ERROR ) printf("Wrong Answer\n");
    }
    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 {
            L = Delete(L, P);
            printf("%d is found and deleted.\n", X);
            if ( L==ERROR )
                printf("Wrong Answer or Empty List.\n");
        }
    }
    L = Insert(L, X, NULL);
    if ( L==ERROR ) printf("Wrong Answer\n");
    else
        printf("%d is inserted as the last element.\n", X);
    P = (Position)malloc(sizeof(struct LNode));
    tmp = Insert(L, X, P);
    if ( tmp!=ERROR ) printf("Wrong Answer\n");
    tmp = Delete(L, P);
    if ( tmp!=ERROR ) printf("Wrong Answer\n");
    for ( P=L; P; P = P->Next ) printf("%d ", P->Data);
    return 0;
}

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

输入样例：

6
12 2 4 87 10 2
4
2 12 87 5

输出样例：

2 is found and deleted.
12 is found and deleted.
87 is found and deleted.
Finding Error: 5 is not in.
5 is inserted as the last element.
Wrong Position for Insertion
Wrong Position for Deletion
10 4 2 5

解答：

Position Find(List L, ElementType X)
{
    for (Position curr = L; curr; curr = curr->Next)
        if (curr->Data == X)
            return curr;
    return ERROR;
}

List Insert(List L, ElementType X, Position P)
{
    Position prev = NULL;
    struct LNode* Node = (List)malloc(sizeof(struct LNode));
    Node->Data = X;
    Node->Next = NULL;

    if (L == NULL)
    {
        L = Node;
        return L;
    }

    for (Position curr = L; curr; curr = curr->Next)
    {
        if (curr == P)
        {
            if (prev == NULL)//插入位置为首元结点
            {
                Node->Next = L;
                L = Node;
            }
            else
            {
                Node->Next = curr;
                prev->Next = Node;
            }
            return L;
        }
        prev = curr;
        if (P == NULL && curr->Next == NULL)//尾部插入
        {
            curr->Next = Node;
            return L;
        }
    }

    printf("Wrong Position for Insertion\n");
    return ERROR;
}

List Delete(List L, Position P)
{
    Position prev = NULL;
    for (Position curr = L; curr; curr = curr->Next)
    {
        if (curr == P)
        {
            if (prev == NULL)//删除位置为首元结点
                L = P->Next;
            else
                prev->Next = P->Next;
            free(P);
            return L;
        }
        prev = curr;
    }

    printf("Wrong Position for Deletion\n");
    return ERROR;
}