对链表中的某一数据进行排序

链表排序代码

源代码

#define  _CRT_SECURE_NO_WARNINGS//消除警告
#include<stdio.h>
#include<stdlib.h>
#include<string.h>


//学生节点 结构体
typedef struct _STU
{
	char arrStuNum[10];
	char arrStuName[10];
	int iStuScore;
	struct _STU* pNext;
}STUNODE;
//链表的头尾
STUNODE* g_pHead = NULL;
STUNODE* g_pEnd = NULL;

void AddStuMSG2(char *arrStuNum, char arrStuName[10], int iStuScore);
void ShowStuData();

 int main(void)
{
	int n_Order = -1;
	char arrStuNum[10] = { '\0' };
	char arrStuName[10] = { '\0' };
	int iStuScore = -1;
	int nFlag = 1;
	while (nFlag)
	{
		printf("请输入指令（10、查看所有指令）");
		scanf("%d", &n_Order);
		switch (n_Order)
		{
		case 1:
			printf("输入学号:");
			scanf("%s", arrStuNum);
			printf("输入姓名:");
			scanf("%s", arrStuName);
			printf("输入分数:");
			scanf("%d", &iStuScore);
			AddStuMSG2(arrStuNum, arrStuName, iStuScore);
			break;
		case 8:
			ShowStuData();
			break;
		default:
			printf("指令不对，请重新输入\n");
		}
	}
	system("pause");
	return 0;
}
void ShowStuData()//显示数据函数
{
	STUNODE* pTemp = g_pHead;
	while (pTemp != NULL)
	{
		printf("学号:%s,姓名:%s,分数:%d\n", pTemp->arrStuNum, pTemp->arrStuName, pTemp->iStuScore);//指针的移动是以一个结构体大小为准移动的
		pTemp = pTemp->pNext;//向下走一位
	}
}
void AddStuMSG2(char *arrStuNum, char arrStuName[10], int iStuScore)//添加学生信息  系统自动排序
{
	//创建一个节点
	STUNODE* pTemp = malloc(sizeof(STUNODE));
	char n_Flag = 1;
	//检验参数合法性
	int m, n, k;//用于判断数据的大小
	if (NULL == arrStuName || NULL == arrStuNum || iStuScore < 0)
	{
		printf("信息输入错误\n");
		return;
	}
	//节点初始化
	strcpy(pTemp->arrStuNum, arrStuNum);
	strcpy(pTemp->arrStuName, arrStuName);
	pTemp->iStuScore = iStuScore;
	pTemp->pNext = NULL;
	//接在链表上
	if (NULL == g_pHead)
	{
		g_pHead = pTemp;
		g_pEnd = pTemp;
	}
	else  if (g_pHead == g_pEnd)                      //判断学号大小    链表仅有一个
	{
		m = atoi(g_pHead->arrStuNum);
		n = atoi(pTemp->arrStuNum);
		if(m>n)
		{
			pTemp->pNext = g_pHead;
			g_pHead = pTemp;
		}
		else
		{
			g_pEnd->pNext = pTemp;
			g_pEnd = pTemp;
		}
	}
	else if (g_pHead->pNext == g_pEnd)//链表有两个
	{
		m = atoi(g_pHead->arrStuNum);
		n = atoi(pTemp->arrStuNum);
		k = atoi(g_pEnd->arrStuNum);
		if(m<n && n<k)//放中间
		{
			pTemp->pNext = g_pHead->pNext;
			g_pHead->pNext = pTemp;
		}
		else if(m>n)//放第一个前面
		{
			pTemp->pNext = g_pHead;
			g_pHead = pTemp;
		}
		else//放尾巴后
		{
			g_pEnd->pNext = pTemp;
			g_pEnd = pTemp;
		}
	}
	else                       //三个以上的链表
	{
		STUNODE* pT = g_pHead;
		while (n_Flag)
		{
			m = atoi(pT->arrStuNum);
			n = atoi(pTemp->arrStuNum);
			k = atoi(pT->pNext->arrStuNum);
			if(m>n)       //放第一位的前面
			{
				pTemp->pNext = g_pHead;
				g_pHead = pTemp;
				n_Flag = 0;
			}
			else if(m<n&&n<k)//放任意两位的中间
			{
				pTemp->pNext = pT->pNext;
				pT->pNext = pTemp;
				n_Flag = 0;
			}
			else if (pT->pNext == g_pEnd)//放尾巴的后面
			{
				g_pEnd->pNext = pTemp;
				g_pEnd = pTemp;
				n_Flag = 0;
			}
			else
			{
				pT = pT->pNext;
			}
		}
	}
}      
//strcmp不能用于判断数组的大小，他是一个字符一个字符的判断；如字符串'45'与‘8’，strcmp（‘45’，‘8’）会判定字符串‘8’更大，所以需要将字符串数组转换为int型，再进行比较。