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

Position Find( List L, ElementType X )
{
    List p=L;
    while(p&&p->Data!=X)
    {
        p=p->Next;
    }
    if(p!=NULL)
        return p;
    else
        return ERROR;
}
List Insert(List L,ElementType X,Position P)
{
   List temp,p;
   if(P==L)
   {
      temp=(List)malloc(sizeof(struct LNode));
      temp->Data=X;
      temp->Next=L;
      L=temp;
      return L;
   }
   temp=L;
   while(temp)
   {
      if(temp->Next==P)
      {
         p=(List)malloc(sizeof(struct LNode));
         p->Data=X;
         p->Next=temp->Next;
         temp->Next=p;
         return L;
      }
      temp=temp->Next;
   }
   printf("Wrong Position for Insertion\n");
   return ERROR;
}
List Delete(List L,Position P)
{
   List p=L;
   if(P==L)
   {
      L=L->Next;
      return L;
   }
   while(p)
   {
      if(p->Next==P)
      {
         p->Next=P->Next;
         free(P);
         return L;
      }
      p=p->Next;
   }
   printf("Wrong Position for Deletion\n");
   return 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 );
void F(List L);//释放内存

int main(void)
{
    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);
    F(L);
    return 0;
}
void F(List L)
{
    List p=L;
    while(p!=NULL)
    {
        L=p->Next;
        free(p);
        p=L;
    }
}
//返回线性表中首次出现X的位置。若找不到则返回ERROR
Position Find( List L, ElementType X )
{
    List p=L;
    while(p&&p->Data!=X)
    {
        p=p->Next;
    }
    if(p!=NULL)//这里不要用if(p->Data==X),因为如果p是空指针，那么它就会报段错误
        return p;
    else
        return ERROR;
}
//将X插入在P指向的结点之前，返回链表的头，如果参数P指向非法位置，则打印“Wrong Position for Insertion”，返回ERROR；
List Insert(List L,ElementType X,Position P)
{
   List q1,q2;
   if(P==L)//P就是L，那它前面就是空
   {
      q1=(List)malloc(sizeof(List));
      q1->Data=X;
      q1->Next=L;
      L=q1;//q1是新的头
      return L;
   }
   q1=L;
   while(q1)
   {
      if(q1->Next==P)//要保证知道p前一个结点的位置
      {
         q2=(List)malloc(sizeof(List));
         q2->Data=X;//创建与初始化
         q2->Next=q1->Next;//q2的下一个是P
         q1->Next=q2;//q2的前一个是q1,这两条语句完成了插入
         return L;
      }
      q1=q1->Next;
   }
   printf("Wrong Position for Insertion\n");//没找到
   return ERROR;
}
//将位置P的元素删除并返回链表的表头。若参数P指向非法位置，则打印“Wrong Position for Deletion”并返回ERROR。
List Delete(List L,Position P)
{
   List q1=L;
   if(P==L)//如果是头
   {
      L=L->Next;
      return L;
   }
   while(q1)
   {
      if(q1->Next==P)
      {
         q1->Next=q1->Next->Next;
         free(P);
         return L;
      }
      q1=q1->Next;
   }
   printf("Wrong Position for Deletion\n");
   return ERROR;
}