链式表操作集 (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
思路:
插入:头插,中插,尾插(p==NULL),非法位置插入(不在链表中)
删除:头删,中删,非法位置删除(链表为空和不在链表)
Position Find( List L, ElementType X ){
while(L!=NULL){
if(L->Data==X){
return L;
}
L=L->Next;
}
return ERROR;//既包含了没有找到L执行到空也包含了L本身为空的情况
}
List Insert(List L, ElementType X, Position P) {
struct LNode *n = (struct LNode*)malloc(sizeof(struct LNode));
List p1, p2;
p1 = p2=L;
if (p1 == P)//在头插入
{
n->Next = p1;
L = n;
n->Data=X;
return L;
}
p2 = p1->Next;
while (p2 != NULL) //在中间插入
{
if (p2 == P) {
n->Next = p2;
p1->Next = n;
n->Data=X;
return L;
}
p1 = p2;
p2 = p1->Next;
}
if (P == NULL) //p==NULL时插入,插入的为数为最后一个数
//因为上边循环出来后p2==NULL;故p1变成了最后一个元素
{
p1->Next=n;
n->Data=X;
n->Next=NULL;
return L;
}
//p不在链表中
else {
printf("Wrong Position for Insertion\n");
return ERROR;
}
}
//以下为插入的另一种写法
/*List Insert( List L, ElementType X, Position P ){
struct LNode *ptr=(struct LNode*)malloc(sizeof(struct LNode ));
ptr->Data=X;
List head=L;
//在头部插入
if(P==head){
ptr->Next=head;
head=ptr;
return head;
}
//在中间插入
while(L->Next!=P&&L->Next)
L=L->Next;
//循环结束后可能是因为遍历完后找到p或p没有找到
if(L->Next==P){
if(P!=NULL){
ptr->Next= P;
L->Next=ptr;
return head;
}//找到p
if(P==NULL){
L->Next=ptr;
ptr->Next=NULL;
return head;
}
}//p为空
else{
printf("Wrong Position for Insertion\n");
return ERROR;
}//没有找到p
}*/
List Delete( List L, Position P ){
List p1,p2;
p1=L;
p2=p1->Next;
//删除头且头不为空
if(P==L&&L){
p1=p1->Next;
free(L);
return p1;
}
//删除中间
while(p2!=NULL){
if(p2==P){
p1->Next=p2->Next;
free(p2);
return L;
}
else{
p1=p2;
}
p2=p1->Next;
}
//非法位置删除,包括链表为空和不在链表中的位置
printf("Wrong Position for Deletion\n");
return ERROR;
}