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
代码实现(C语言)
Position Find( List L, ElementType X )
{
List TmpL = (List)malloc(sizeof(List));
TmpL = L; /* 为了不破坏给的链表 */
while(TmpL != NULL) /* 链表没有走完就一直找 */
{
if(TmpL->Data == X) /* 找到目标,返回位置 */
return TmpL;
TmpL = TmpL->Next;
}
return ERROR; /* 未找到则返回ERROR */
}
List Insert( List L, ElementType X, Position P )
{
/* 建立一个新的节点,Data为插入元素,指向要被插入的地方 */
List TmpCell = (List)malloc(sizeof(List));
TmpCell->Data = X;
TmpCell->Next = P;
/* 插入位置中表头时 */
if(L == P)
{
return TmpCell;
}
else /* 插入位置在表中,则遍历链表找到插入位置的前一个节点 */
{
List TmpL = (List)malloc(sizeof(List));
TmpL = L;
while(TmpL)
{
if(TmpL->Next == P) /*找到前一个位置,然后插入*/
{
TmpL->Next = TmpCell;
return L;
}
TmpL = TmpL->Next;
}
}
/* 找不到则说明是无效数据 */
printf("Wrong Position for Insertion\n");
return ERROR;
}
List Delete( List L, Position P )
{
/* 删除表头的情况 */
if(L == P)
return L->Next;
else /* 删除表中某节点的情况 */
{
List TmpL = (List)malloc(sizeof(List));
TmpL = L;
while(TmpL) /* 遍历找到删除节点的前一个位置 */
{
if(TmpL->Next == P) /* 找到并删除 */
{
TmpL->Next = P->Next;
free(P);
return L;
}
TmpL = TmpL->Next;
}
}
/* 未找到则为无效位置 */
printf("Wrong Position for Deletion\n");
return ERROR;
}