链表操作集

#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 Print( List L ){
    List tmp=L;
    while(tmp!=NULL){
        printf("%d ",tmp->Data);
        tmp=tmp->Next;
    }
    printf("\n");
}
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");
        }
        Print(L);
    }
    L = Insert(L, X, NULL);
    Print(L);
    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);
    Print(L);
    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 ){
    List head=L;
    while(head!=NULL){
        if(head->Data == X)
            return head;
        head=head->Next;
    }
    return ERROR;
}
List Insert( List L, ElementType X, Position P ){
    List head = L;
    List n = (List)malloc(sizeof(struct LNode));
    n->Data = X;
    n->Next = NULL;
    if(L==P){
        L=n;
        n->Next=P;
        return L;
    }
    else if(P==NULL){//插到最后
        while(head->Next){
            head=head->Next;
        }
        head->Next=n;
        return L;
    }
    else{
        int flag=0;
        while(head){//至少有两个节点
            if(head->Next == P){
                flag=1;
                break;
            }
            head=head->Next;
        }
        if(flag){
            head->Next=n;
            n->Next=P;
            return L;
        }
        else{
            printf("Wrong Position for Insertion\n");
            return ERROR;
        }
    }
}
List Delete( List L, Position P ){
    if(L==NULL){
        printf("Wrong Position for Deletion\n");
        return ERROR;
    }
    List head=L;
    int flag=0;
    if(L==P){
        head=head->Next;
        free(P);
        return head;
    }
    while(head){
        if(head->Next == P){
            flag=1;
            break;
        }
        head=head->Next;
    }
    if(flag){
        head->Next=P->Next;
        free(P);
        return L;
    }
    else{
        printf("Wrong Position for Deletion\n");
        return ERROR;
    }
}