数据结构与算法——6-5 链式表操作集 (20分)

6-5 链式表操作集 (20分)

裁判测试程序样例：

#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;
}

/* 你的代码将被嵌在这里 */

思路：链表的基本操作，唯一注意别随意改动头指针的位置，不然再重新遍历会很困难，因此我们必须习惯用一个临时创建的局部变量来指向L所指的位置，然后改变T的指向，让L保持位置不变

Position Find(List L,ElementType X){
    List T=L;
    while(T)
    {
        if(T->Data==X)
            return T;
        T=T->Next;
    }
    return ERROR;
}
List Insert(List L,ElementType X,Position P){
    List head=L;
    if(L==P){
        head=(List)malloc(sizeof(struct LNode));
        head->Data=X;
        head->Next=P;
        return head;
    }//第一次插入 相当于建表
    while(L){
        if(L->Next==P)
            break;
        L=L->Next;
    }
    if(!L){
        printf("Wrong Position for Insertion\n");
        return ERROR;
    }
    L->Next=(List)malloc(sizeof(struct LNode));
    L->Next->Data=X;
    L->Next->Next=P;
    return head;    
}
List Delete(List L,Position P){
    if(L==P)
    {
        L=L->Next;
        return L;
    }
    List head=L;
    while(L)
    {
        if(L->Next==P)
            break;
        L=L->Next;
    }
    if(!L)
    {
        printf("Wrong Position for Deletion\n");
        return ERROR;
    }
    L->Next=P->Next;//删除操作
    free(P);

    return head;
}