基于单向链表的后宫管理系统

单向链表的实例–后宫管理系统

管理系统类：增-删-改-查

1.菜单

菜单功能：退出系统 写入信息 浏览信息 查找信息 删除信息 修改信息

代码如下：

void ShowMenu()
{
	printf("【--------------------后宫管理系统--------------------】\n");
	printf("【-------------------0\\0.退出系统--------------------】\n");
	printf("【-------------------1\\1.写入信息--------------------】\n");
	printf("【-------------------2\\2.浏览信息--------------------】\n");
	printf("【-------------------3\\3.查找信息--------------------】\n");
	printf("【-------------------4\\4.删除信息--------------------】\n");
	printf("【-------------------5\\5.修改信息--------------------】\n");
	printf("【--------------------   V--1.0   --------------------】\n");
}

2.逻辑处理

2.0创建结构体

创建节点的结构体，每个节点中包含一个Girl

2.0.1创建Girl结构体

代码如下：

struct Girl
{
	char* name[20];
	int age;
	int num;
	char grade[10];
};

2.0.2创建节点

struct Node
{
	struct Girl girl;
	struct Node* next;
};

2.1打印链表

void Print_Node(struct Node* HeadNode)
{
	struct Node* posNode = HeadNode;
	if (posNode->next == NULL)
		printf("信息为空！\n");
	else
	{
		printf("name\tage\tnum\tgrade\t\n");
		while (posNode->next != NULL)
		{
			printf("%s\t%d\t%d\t%s\t", posNode->next->girl.name,posNode->next->girl.age, posNode->next->girl.num, posNode->next->girl.grade);
			posNode = posNode->next;
		}
	}

}

2.2验证输入（int）

如果缺少这一步，当输入不合法时，程序会出错退出

int scanf_Key()
{
	int n; char c;
	while (!scanf_s("%d", &n) || n > 5)
	{
		while ((c = getchar()) != '\n')
			putchar(c);
		printf("不符合规范，您必须输入一个0-5的数字\n");;
	}
	return n;
}

2.3创建链表头

struct Node* CreateHead()
{
	struct Node* HeadNode = (struct Node*)malloc(sizeof(struct Node));
	HeadNode->next = NULL;
	return HeadNode;
}

2.4插入信息

void Insert_By_Head(struct Node* HeadNode, struct Girl NewGirl)
{
	struct Node* NewNode = (struct Node*)malloc(sizeof(struct Node));
	NewNode->girl = NewGirl;
	NewNode->next = HeadNode->next;
	HeadNode->next = NewNode;
}

2.5浏览信息

直接调用Print_Node（）函数即可

2.6查找信息

按姓名查找的算法如下

struct Node* SearchInfoByName(struct Node* HeadNode, char* filename)
{
	struct Node* posNode = HeadNode;
	while (posNode->next != NULL && strcmp(posNode->next, filename))
		posNode = posNode->next;
	if (posNode->next == NULL)
	{
		printf("未找到相关信息\n");
		return NULL;
	}
	return posNode;
}

接着在查找函数中调用该函数：

void PrintSearchedInfo(struct Node* HeadNode)
{
	char TempName[20];
	printf("请输入你想要查找的妃子姓名：\n");
	scanf_s("%s", TempName, 20);
	struct Node* TargetInfo = SearchInfoByName(HeadNode, TempName);
	if (TargetInfo != NULL && TargetInfo->next != NULL)
	{
		printf("name\tage\tnum\tgrade\t\n");
		printf("%s\t%d\t%d\t%s\t\n", TargetInfo->next->girl.name, TargetInfo->next->girl.age, TargetInfo->next->girl.num, TargetInfo->next->girl.grade);
	}
}

2.7删除信息

核心还是查找算法

void DeleteInfo(struct Node* HeadNode)
{
	char TempName[20];
	printf("请输入你想要删除的妃子姓名：\n");
	scanf_s("%s", TempName, 20);
	struct Node* TargetInfo = SearchInfoByName(HeadNode, TempName);
	if (TargetInfo != NULL && TargetInfo->next != NULL)
	{
		struct Node* next = TargetInfo->next;
		TargetInfo->next = TargetInfo->next->next;
		next = NULL;
		free(next);
		printf("删除成功！\n");
	}
}

2.8修改信息

void ChangeInfo(struct Node* HeadNode)
{
	char TempName[20];
	printf("请输入你想要修改的妃子姓名：\n");
	scanf_s("%s", TempName, 20);
	struct Node* TargetInfo = SearchInfoByName(HeadNode, TempName);
	if (TargetInfo != NULL && TargetInfo->next != NULL)
	{
		struct Girl girl;
		printf("请输入修改后的姓名:\n");
		scanf_s("%s", girl.name, 20);
		printf("请输入修改后的年龄:\n");
		scanf_s("%d", &girl.age);
		printf("请输入修改后编号:\n"); 
		scanf_s("%d", &girl.num);
		printf("请输入修改后等级:\n");
		scanf_s("%s", girl.grade, 10);
		TargetInfo->next->girl = girl;
		printf("修改成功！\n");
	}
}

3.按键处理

直接在主函数里调用就OK了

void KeyBored()
{
	struct Node* HeadNode = CreateHead();
	while (1)
	{
		ShowMenu();
		printf("请输入指令：\n");
		int Key = scanf_Key();
		printf("%d\n", Key);
		switch (Key)
		{
		case EXIT:
			printf("谢谢使用！\n");
			return;
		case INSERT:
			InsertInfo(HeadNode);
			system("pause");
			system("cls");
			break;
		case READ:
			Print_Node(HeadNode);
			system("pause");
			system("cls");
			break;
		case SEARCH:
			PrintSearchedInfo(HeadNode);
			system("pause");
			system("cls");
			break;
		case DELETE:
			DeleteInfo(HeadNode);
			system("pause");
			system("cls");
			break;
		case CHANGE:
			ChangeInfo(HeadNode);
			system("pause");
			system("cls");
			break;
		default:
			break;
		}
	}
}