6-5 不带头结点链式表操作集(PTA)

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

函数接口定义：
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)
{
	PtroLNode p=L;
	while(p)
	{
        if(p->Data==X)
		return p;
        p=p->Next;
    }
	return ERROR;
}
List Insert(List L,ElementType X,Position P)
{   
    PtrToLNode p,e;
    p=L;//用p作为动态指针，L本身做表头 
    e=(List)malloc(sizeof(struct LNode));//将新节点先表示出来 
    e->Next=NULL;
	e->Data=X;
    if(P==p)//插入位置P为表头，那么直接让新节点做表头，指向旧表头 
	{
        e->Next=P;
        return e;
    }
    while(p->Next)//正常插入表中间
	{
        if(p->Next==P)
		{
            e->Next=P;
            p->Next=e;
            return L;
        }
		p=p->Next;
    }
    if(P==NULL)//如果P为NULL，插入到最后
	{
        p->Next=e;//p已经是走完一次表了，直接指向e即可 
        return L;
    }
    printf("Wrong Position for Insertion\n");//剩下的就是P指向非法位置
    return ERROR;
}
List Delete(List L,Position P)
{
	PtrToLNode p,tmp,e;
	p=L;//p为动态遍历表的指针，L本身做表头 
    if(P==p)//P在表头 
	{
        tmp=p;
        p=p->Next;//p指针后移，作为新表头 
        free(tmp);
        return p;
    }
    if(p->Next)
	e=p->Next;
    while(p->Next)
	{
        if(e==P&&e->Next)//P在表中且不为尾节点
        {
            tmp=e;
            e=e->Next;
            p->Next=e;
            free(tmp);
            return L;
        }
        if(e==P&&e->Next==NULL)//P是尾节点
        {
            p->Next=NULL;
            free(e);
            return L;
        }
        e=e->Next;
        p=p->Next;
    }
        printf("Wrong Position for Deletion\n");//剩下的就是非法情况(指针指向非法位置)
        return ERROR;
}