C语言带头节点的链表标准标准模板代码

6-6 带头结点的链式表操作集 （20 point(s)）

本题要求实现带头结点的链式表操作集。

函数接口定义：

List MakeEmpty(); 
Position Find( List L, ElementType X );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );

其中List结构定义如下：

typedef struct LNode *PtrToLNode;
struct LNode {
    ElementType Data;
    PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;

各个操作函数的定义为：

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

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

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

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

 

从定义来说，带不带头节点的链表的定义都一样，只是实现的时候第一个位置不方元素，作为头节点。插入删除都是标准的做法

建立链表

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

链表的遍历搜索

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

		Current = Current->Next;
	}
	return ERROR;
}

链表的插入

bool Insert(List L, ElementType X, Position P)
{
	PtrToLNode Current, NewNode;
	NewNode = (PtrToLNode)malloc(sizeof(struct LNode));
	NewNode->Data = X;
	Current = L;
	
	while (Current->Next)
	{
		if (Current->Next == P)
		{
			break;
		}
		Current = Current->Next;
	}

	if (P == NULL)
	{
		// 插入到表尾情况
		Current->Next = NewNode;
		NewNode->Next = NULL;
		return true;
	}

	if (Current->Next == NULL)
	{
		// 如果没有该节点
		printf("Wrong Position for Insertion\n");
		return false;
	}

	NewNode->Next = Current->Next;
	Current->Next = NewNode;
	return true;

}

链表节点的删除

bool Delete(List L, Position P)
{
	PtrToLNode Current, Temp=NULL;
	Current = L;
	while (Current->Next)
	{
		if (Current->Next == P)
		{
			Temp = Current->Next;
			break;
		}
		Current = Current->Next;
	}

	if (Current->Next == NULL)
	{
		printf("Wrong Position for Deletion\n");
		return false;
	}

	Current->Next = Temp->Next;
	free(Temp);
	return true;

}

完整代码

#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);

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 = (List)malloc(sizeof(struct LNode));
	L->Next = NULL;
	return L;
}

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

		Current = Current->Next;
	}
	return ERROR;
}

bool Insert(List L, ElementType X, Position P)
{
	PtrToLNode Current, NewNode;
	NewNode = (PtrToLNode)malloc(sizeof(struct LNode));
	NewNode->Data = X;
	Current = L;
	
	while (Current->Next)
	{
		if (Current->Next == P)
		{
			break;
		}
		Current = Current->Next;
	}

	if (P == NULL)
	{
		// 插入到表尾情况
		Current->Next = NewNode;
		NewNode->Next = NULL;
		return true;
	}

	if (Current->Next == NULL)
	{
		// 如果没有该节点
		printf("Wrong Position for Insertion\n");
		return false;
	}

	NewNode->Next = Current->Next;
	Current->Next = NewNode;
	return true;

}

bool Delete(List L, Position P)
{
	PtrToLNode Current, Temp=NULL;
	Current = L;
	while (Current->Next)
	{
		if (Current->Next == P)
		{
			Temp = Current->Next;
			break;
		}
		Current = Current->Next;
	}

	if (Current->Next == NULL)
	{
		printf("Wrong Position for Deletion\n");
		return false;
	}

	Current->Next = Temp->Next;
	free(Temp);
	return true;

}