本题要求实现链式表的操作集。
函数接口定义:
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
#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;
}
Position Find( List L, ElementType X ){
Position temp;
if(L==NULL) return ERROR;
while(L!=NULL){
if(L->Data==X){
temp=L;
return temp;
}
L=L->Next;
}
return ERROR;
}
List Insert( List L, ElementType X, Position P ){
List tmp = L; //保存链表表头
List apply = NULL; //待插入的新节点
if(L == P){ //如果插入位置P等于表头,则需要插在整个链表之前
apply = (List) malloc((sizeof(struct LNode))); //分配空间
apply->Data = X;
apply->Next = P;
tmp = apply; //将表头指针重新指向新的表头
return tmp;
}
while(L->Next != P && L->Next != NULL)//若没找到P并且没到链尾则往下移动
L = L->Next;
if(L->Next == NULL&&P!=NULL){//如果已经到了链尾,说明P肯定不在链表里,而此时P又不为NULL,则一定是P出现了错误
printf("Wrong Position for Insertion\n");
return ERROR;
}
else //有三种情况:第一种L->Next!=NULL,P!=NULL是普通情况
{ //第二种L->Next!=NULL,P==NULL 这种情况不存在,
//因为若P==NULL,则退出while循环后L->Next或者走到L->Next=NULL或者L->Next=P仍为NULL,所以此种情况不存在。
//第三种L->Next==NULL,P==NULL 则插在链表末尾
apply = (List) malloc((sizeof(struct LNode)));
apply->Data = X;
L->Next = apply;
apply->Next = P;
return tmp;
}
}
List Delete( List L, Position P ){
List temp = L;
if(L == NULL||P==NULL){ //如果是空表或者删除的位置是NULL,则不能删除
printf("Wrong Position for Deletion\n");
return ERROR;
}
if(L == P){ //如果删除的位置是表头
temp = L ->Next;
free(L);
return temp;
}
while(L->Next != P && L->Next != NULL)
L = L ->Next;
if(L->Next == NULL){ //P一定在链表上,如果始终没有找到P,则删除错误
printf("Wrong Position for Deletion\n");
return ERROR;
}
else{ //否则删除P
L->Next = P->Next;
free(P);
return temp;
}
}
题目链接: