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

6-5 链式表操作集 （20 point(s)）

本题要求实现链式表的操作集。

函数接口定义：

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

其中List结构定义如下：

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

各个操作函数的定义为：

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

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

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

 

链表查找，从第一个节点开始遍历，比较节点

Position Find(List L, ElementType X)
{

	PtrToLNode Current = L;
	while (Current)
	{
		if (Current->Data == X)
		{
			return Current;
		}
		Current = Current->Next;
	}

	return ERROR;
}

链表的插入

List Insert(List L, ElementType X, Position P)
{
	PtrToLNode Current, NewNode;
	NewNode = (PtrToLNode)malloc(sizeof(struct LNode));  // 创建新的表头
	NewNode->Data = X;
	NewNode->Next = NULL;

	// 表头插入
	if (P == L)
	{
		NewNode->Next = P;
		L = NewNode;
		return L;
	}

	Current = L;
	// 插入是过程中要找到前一个元素
	while (Current)
	{
		if (Current->Next == P)
			break;
		Current = Current->Next;
	}

	if (Current == NULL)
	{
		// 节点P非法
		printf("Wrong Position for Insertion\n");
		return ERROR;
	}

	NewNode->Next = P;
	Current->Next = NewNode;

	return L;

}

链表的删除

List Delete(List L, Position P)
{
	PtrToLNode Current, Temp;
	// 表头删除
	if (P == L)
	{
		Temp = L;
		L = L->Next;
		free(Temp);
		return L;
	}
	Current = L;

	// 删除同样要找到前一个节点
	while (Current)
	{
		if (Current->Next == P)
			break;
		Current = Current->Next;
		
	}

	if (Current == NULL)
	{
		// 如果要删除的节点非法
		printf("Wrong Position for Deletion\n");
		return ERROR;
	}

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

	return L;
}

完整代码

#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_s("%d", &N);
	while (N--) 
	{
		scanf_s("%d", &X);
		L = Insert(L, X, L);
		if (L == ERROR) 
			printf("Wrong Answer\n");
	}

	PtrToLNode Current;
	Current = L;

	while (Current)
	{
		printf("%d ", Current->Data);
		Current = Current->Next;
	}

	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 
		{
			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;
	
}

/* 你的代码将被嵌在这里 */
Position Find(List L, ElementType X)
{

	PtrToLNode Current = L;
	while (Current)
	{
		if (Current->Data == X)
		{
			return Current;
		}
		Current = Current->Next;
	}

	return ERROR;
}

List Insert(List L, ElementType X, Position P)
{
	PtrToLNode Current, NewNode;
	NewNode = (PtrToLNode)malloc(sizeof(struct LNode));  // 创建新的表头
	NewNode->Data = X;
	NewNode->Next = NULL;

	// 表头插入
	if (P == L)
	{
		NewNode->Next = P;
		L = NewNode;
		return L;
	}

	Current = L;
	// 插入是过程中要找到前一个元素
	while (Current)
	{
		if (Current->Next == P)
			break;
		Current = Current->Next;
	}

	if (Current == NULL)
	{
		// 节点P非法
		printf("Wrong Position for Insertion\n");
		return ERROR;
	}

	NewNode->Next = P;
	Current->Next = NewNode;

	return L;

}

List Delete(List L, Position P)
{
	PtrToLNode Current, Temp;
	// 表头删除
	if (P == L)
	{
		Temp = L;
		L = L->Next;
		free(Temp);
		return L;
	}
	Current = L;

	// 删除同样要找到前一个节点
	while (Current)
	{
		if (Current->Next == P)
			break;
		Current = Current->Next;
		
	}

	if (Current == NULL)
	{
		// 如果要删除的节点非法
		printf("Wrong Position for Deletion\n");
		return ERROR;
	}

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

	return L;
}