数据结构-链表-复习

6-6 带头结点的链式表操作集 (20分)

注意: 1 未malloc 2 指针遍历时未更新
代码：

#include <stdio.h>
#include <stdlib.h>

#define ERROR NULL
//typedef enum {false, true} bool;
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
    ElementType Data;
    PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;

List MakeEmpty(); 
Position Find( List L, ElementType X );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );
void Print(List L){
    PtrToLNode p = L->Next;
    while(p){
        printf("%d ", p->Data);
        p = p->Next;
    }
    printf("\n");
}
int main()
{
    List L;
    ElementType X;
    Position P;
    int N;
    bool flag;

    L = MakeEmpty();
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        flag = Insert(L, X, L->Next);
        if ( flag==false ) printf("Wrong Answer\n");
    }
    Print(L);
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        P = Find(L, X);
        printf("find\n");
        if ( P == ERROR )
            printf("Finding Error: %d is not in.\n", X);
        else {
            flag = Delete(L, P);
            printf("%d is found and deleted.\n", X);
            if ( flag==false )
                printf("Wrong Answer.\n");
        }
        Print(L);
    }
    flag = Insert(L, X, NULL);
    if ( flag==false ) printf("Wrong Answer\n");
    else
        printf("%d is inserted as the last element.\n", X);
    P = (Position)malloc(sizeof(struct LNode));
    flag = Insert(L, X, P);
    if ( flag==true ) printf("Wrong Answer\n");
    flag = Delete(L, P);
    if ( flag==true ) printf("Wrong Answer\n");
    for ( P=L->Next; P; P = P->Next ) printf("%d ", P->Data);
    int a; scanf("%d", &a);
    return 0;
}
/* 你的代码将被嵌在这里 */
List MakeEmpty(){
    List L;
    L = (List) malloc(sizeof(struct LNode));
    L->Next = NULL;
    if(!L) exit;
    return L;
}
Position Find( List L, ElementType X ){
    PtrToLNode p;
    p = L->Next;
    while(p){
        if(p->Data == X) return p;
        p = p->Next;
    }
    return ERROR;
}
bool Insert( List L, ElementType X, Position P ){
    PtrToLNode p;
    p = L;
    while(p){
        if(p->Next == P){
            PtrToLNode q;
            q = (PtrToLNode) malloc(sizeof(struct LNode));
            q->Next = P;
            q->Data = X;
            p->Next = q;
            return true;
        }
        p = p->Next;
    }
    printf("Wrong Position for Insertion\n");
    return false;
}
bool Delete( List L, Position P ){
    PtrToLNode p;
    p = L;
    while(p){
        if(p->Next == P){
            p->Next = P->Next;
            free(P);
            return true;
        }
        p = p->Next;
    }
    printf("Wrong Position for Deletion\n");
    return false;
}

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);
    int a;
    scanf("%d", &a);
    return 0;
}

/* 你的代码将被嵌在这里 */
Position Find( List L, ElementType X ){
    PtrToLNode 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;
    p = L;
    /*if(L == NULL) {
        P = ( PtrToLNode) malloc(sizeof(struct LNode));
        P->Data = X;
        P->Next = NULL;
        printf("1");
        return P;
    }*/
    if(L == P){
        P =  ( PtrToLNode) malloc(sizeof(struct LNode));
        P->Data = X;
        P->Next = L;
        //printf("2");
        return P;
    }
    while(p){       
        if(p->Next == P){
            PtrToLNode q;
            q = ( PtrToLNode) malloc(sizeof(struct LNode));
            q->Next = P;
            q->Data = X;
            p->Next = q;
            //printf("3");
            return L;
        }
        p = p->Next;
    }
    printf("Wrong Position for Insertion\n");
    return ERROR;
}
List Delete( List L, Position P ){
    PtrToLNode p;
    p = L;
    if(P == L){
        L = L->Next;
        return L;
    }
    while(p){
        
        if(p->Next == P){
            PtrToLNode q = p->Next;
            p->Next = q->Next;
            free(q);
            q = NULL;
            return L;
        }
        p = p->Next;
    }
    printf("Wrong Position for Deletion\n");
    return ERROR;
}