#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;
List MakeEmpty();
Position Find(List L, ElementType X);
bool Insert(List L, ElementType X, Position P);
bool Delete(List L, Position P);
int main()
{
List L;
ElementType X;
Position P;
int N;
bool flag;
L = MakeEmpty();
scanf_s("%d", &N);
while (N--) {
scanf_s("%d", &X);
flag = Insert(L, X, L->Next);
if (flag == false) printf("Wrong Answer\n");
}
scanf_s("%d", &N);
while (N--) {
scanf_s("%d", &X);
P = Find(L, X);
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");
}
}
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);
return 0;
}
List MakeEmpty()
{
List L;
L = (List)malloc(sizeof(LNode));
L->Next = NULL;
return L;
}
Position Find(List L, ElementType X)
{
Position p;
p = L;
while (p)
{
if (p->Data == X)
return p;
p = p->Next;
}
return ERROR;
}
// 将X插入在位置P指向的结点之前,返回true。
// 如果参数P指向非法位置,则打印“Wrong Position for Insertion”,返回false
bool Insert(List L, ElementType X, Position P)
{
Position p, s;
p = L;
while (p->Next != P&&p->Next)
p = p->Next;
if (p->Next == NULL && P != NULL)
{
printf("Wrong Position for Insertion\n");
return false;
}
s = (Position)malloc(sizeof(LNode));
s->Data = X;
s->Next = P;
p->Next = s;
return true;
}
// 将位置P的元素删除并返回true。若参数P指向非法位置,
// 则打印“Wrong Position for Deletion”并返回false。
bool Delete(List L, Position P)
{
Position p;
p = L;
while (p->Next != P&&p->Next)
{
p = p->Next;
}
if (p->Next == NULL && P != NULL)
{
printf("Wrong Position for Deletion\n");
return false;
}
if (P == NULL)
return true;
p->Next = p->Next->Next;
free(P);
return true;
}