#pragma warning(disable:4996)
#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;
}
List Insert(List L, ElementType X, Position P) {
if (P == L) {
List q = (List)malloc(sizeof(List));
q->Data = X;
q->Next = L;
return q;
}
List q = L;
while (q) {
if (q->Next == P) {
List p = (List)malloc(sizeof(List));
p->Next = q->Next;
p->Data = X;
q->Next = p;
return L;
}
q = q->Next;
}
printf("Wrong Position for Insertion\n");
return ERROR;
}
/* 你的代码将被嵌在这里 */
//Position Find(List L, ElementType X) { //:返回线性表中首次出现X的位置。若找不到则返回ERROR;
// List p;
// p = L;
// while (p!=NULL) {
// if (p->Data == X)
// return p;
// p = p->Next;
// }
// return ERROR;
//}
Position Find(List L, ElementType X) {
List q;
q = L;
while (q != NULL) {
if (q->Data == X) {
return q;
}
q = q->Next;
}
return ERROR;
}
List Delete(List L, Position P) { //:将位置P的元素删除并返回链表的表头。若参数P指向非法位置,则打印“Wrong Position for Deletion”并返回ERROR。
if (P==NULL) {
printf("Wrong Position for Deletion");
return ERROR;
}
if (L == P) {
return L->Next;
}
List q=L;
while(q) {
if (q->Next == P) {
// 删除节点
q->Next = q->Next->Next;
return L;
}
q = q->Next;
}
printf("Wrong Position for Deletion\n");
return ERROR;
}
//List Delete(List L, Position P) {
// if (L == P) {
// return L->Next;
// }
//
// List q = L;
// while (q) {
// if (q->Next == P) {
// q->Next = q->Next->Next;
// return L;
// }
// q = q->Next;
// }
// printf("Wrong Position for Deletion\n");
// return ERROR;
//}