6-6 带头结点的链式表操作集(20 分)
本题要求实现带头结点的链式表操作集。
函数接口定义:
List MakeEmpty();
Position Find( List L, ElementType X );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );
其中List
结构定义如下:
typedef struct LNode *PtrToLNode;
struct LNode {
ElementType Data;
PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;
各个操作函数的定义为:
List MakeEmpty()
:创建并返回一个空的线性表;
Position Find( List L, ElementType X )
:返回线性表中X的位置。若找不到则返回ERROR;
bool Insert( List L, ElementType X, Position P )
:将X插入在位置P指向的结点之前,返回true。如果参数P指向非法位置,则打印“Wrong Position for Insertion”,返回false;
bool Delete( List L, Position P )
:将位置P的元素删除并返回true。若参数P指向非法位置,则打印“Wrong Position for Deletion”并返回false。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
#define ERROR NULL
typedef enum {false, true} bool;
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
ElementType Data;
PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;
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;
bool flag;
L = MakeEmpty();
scanf("%d", &N);
while ( N-- ) {
scanf("%d", &X);
flag = Insert(L, X, L->Next);
if ( flag==false ) 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 {
flag = Delete(L, P);
printf("%d is found and deleted.\n", X);
if ( flag==false )
printf("Wrong Answer.\n");
}
}
flag = Insert(L, X, NULL);
if ( flag==false ) printf("Wrong Answer\n");
else
printf("%d is inserted as the last element.\n", X);
P = (Position)malloc(sizeof(struct LNode));
flag = Insert(L, X, P);
if ( flag==true ) printf("Wrong Answer\n");
flag = Delete(L, P);
if ( flag==true ) printf("Wrong Answer\n");
for ( P=L->Next; 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
怎么说呢,如果看到过我之前发布的不带头结点那篇,这个做起来应该不算难了吧。只是这个多了制造空链表的函数:List MakeEmpty(),但幸运的是因为有了头结点,也就是不带任何数据的头指针(当然这个头指针你确实也可以扔点什么进去,我看别人写的时候没事就往里头扔个‘0’),我们可以不用考虑如果要删除的就是第一个,要如何多打一段删除头结点的代码,插入的时候也是,这就是多了头结点的好处。
具体实现的代码如下:
List MakeEmpty()
{
List Head = (List)malloc(sizeof(struct LNode));
Head->Next = NULL;
return Head;
}
Position Find( List L, ElementType X )
{
List F=L;
while(F)
{
if( F->Data==X )
return F;
F = F->Next;
}
return ERROR;
}
bool Insert( List L, ElementType X, Position P )
{
List T = (List)malloc(sizeof(struct LNode));
T->Data = X;
T->Next = P;
while( L )
{
if( L->Next == P )
{
L->Next = T;
return true;
}
L = L->Next;
}
printf("Wrong Position for Insertion\n");
return false;
}
bool Delete( List L, Position P )
{
List T = P;
while( L&&L->Next != P )
L = L->Next;
if(L)
{
L->Next = P->Next;
free(T);//释放空间
return true;
}
printf("Wrong Position for Deletion\n");
return false;
}
编译器:DEV C++