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

带头结点的意思就是头结点不写数据

因为每次插入都是找到需要插入的位置P的前一个位置的节点，所以第一个有数据的节点前一个位置的节点是头结点

#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("%d", &N);
	while (N--) {
		scanf("%d", &X);
		flag = Insert(L, X, L->Next);
		if (flag == false) 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 {
			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);
	system("PAUSE");
	return 0;
}
/* 你的代码将被嵌在这里 */

List MakeEmpty(){
	List L = (List)malloc(sizeof(struct LNode));
	L->Next=NULL;
	return L;
}
Position Find(List L, ElementType X){
	while (L){
		if (L->Data == X){
			return L;
		}
		L = L->Next;
	}
	return ERROR;
}
bool Insert(List L, ElementType X, Position P){
	List need = (List)malloc(sizeof(struct LNode));
	need->Data = X;
	while (L){
		if (L->Next == P){
			need->Next = L->Next;
			L->Next = need;
			return true;
		}
		L = L->Next;
	}
	printf("Wrong Position for Insertion\n");
	return false;
}
bool Delete(List L, Position P){
	if (L == P)
		return true;
	List t = L;
	while (t){
		if (t->Next == P){
			t->Next = t->Next->Next;
			return true;
		}
		t = t->Next;
	}
	printf("Wrong Position for Deletion\n");
	return false;
}

创建make

List MakeEmpty()：创建并返回一个空的线性表；

List MakeEmpty(){
	List L = (List)malloc(sizeof(struct LNode));
	L->Next = NULL;
	return L;
}

寻找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

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

bool Insert(List L, ElementType X, Position P){
	List need = (List)malloc(sizeof(struct LNode));
	need->Data = X;
	while (L){
		if (L->Next == P){
			need->Next = L->Next;
			L->Next = need;
			return true;
		}
		L = L->Next;
	}
	printf("Wrong Position for Insertion\n");
	return false;
}

删除delete

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

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