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);
	system("pause");
	return 0;
}

/* 你的代码将被嵌在这里 */
Position Find(List L, ElementType X){
	while (L){
		if (L->Data == X){
			return L;
		}
		L = L->Next;
	}
	return ERROR;
}
List Insert(List L, ElementType X, Position P){
	List need = (List)malloc(sizeof(struct LNode));
	need->Data = X;
	if (L == P){//插入头结点
		need->Next = L;
		return need;
	}
	List t = L;
	while (t){
		if (t->Next == P){
			need->Next = t->Next;
			t->Next = need;
			return L;
		}
		t = t->Next;
	}
	printf("Wrong Position for Insertion\n");
	return ERROR;
}
List Delete(List L, Position P){
	if (L == P)
		return L->Next;
	List t = L;
	while (t){
		if (t->Next == P){
			t->Next = t->Next->Next;
			return L;
		}
		t = t->Next;
	}
	printf("Wrong Position for Deletion\n");
	return ERROR;
}

寻找find

Position Find( List L, ElementType X )：返回线性表中首次出现X的位置。若找不到则返回ERROR；

Position Find(List L, ElementType X){
	while (L){
		if (L->Data == X){
			return L;
		}
		L = L->Next;
	}
	return ERROR;
}

插入insert

List Insert( List L, ElementType X, Position P )：将X插入在位置P指向的结点之前，返回链表的表头。如果参数P指向非法位置，则打印“Wrong Position for Insertion”，返回ERROR；

List Insert(List L, ElementType X, Position P){
	List need = (List)malloc(sizeof(struct LNode));
	need->Data = X;
	if (L == P){//插入头结点
		need->Next = L;
		return need;
	}
	List t = L;
	while (t){
		if (t->Next == P){
			need->Next = t->Next;
			t->Next = need;
			return L;
		}
		t = t->Next;
	}
	printf("Wrong Position for Insertion\n");
	return ERROR;
}

删除delete

List Delete( List L, Position P )：将位置P的元素删除并返回链表的表头。若参数P指向非法位置，则打印“Wrong Position for Deletion”并返回ERROR。

List Delete(List L, Position P){
	if (L == P)
		return L->Next;
	List t = L;
	while (t){
		if (t->Next == P){
			t->Next = t->Next->Next;
			return L;
		}
		t = t->Next;
	}
	printf("Wrong Position for Deletion\n");
	return ERROR;
}