有序链表的构建

头文件

#include<stdio.h>
#include<assert.h>
#include<malloc.h>

封装节点

struct Data {
	int mmData;//数值
	int index;//序号
};
typedef struct Node {
	Data data;//自定义Data类型的数据
	struct Node* next;//next指针
}*LPNODE,NODE;

封装链表

typedef struct List {
	LPNODE headNode;//头节点
	int sqlistSize;//当前节点数量
}*LPLIST;

创建节点的函数

LPNODE CreateNewNode(Data Mydata) {//创建新节点
	LPNODE newNode = (LPNODE)malloc(sizeof(Node));
	assert(newNode);//判空
	//初始化内容
	newNode->next = NULL;
	newNode->data = Mydata;
	return newNode;
}
LPNODE CreateHeadNode() {//创建头节点
	LPNODE headNode = (LPNODE)malloc(sizeof(Node));
	assert(headNode);
	headNode->next = NULL;
	return headNode;
}

创建链表

LPLIST CreateList() {//创建链表
	LPLIST list = (LPLIST)malloc(sizeof(List));
	assert(list);
	//初始化
	list->headNode = CreateHeadNode();
	list->sqlistSize = 0;
	return list;
}

有序插入的实现

void insertBysqlist(LPLIST list,Data data) {//有序插入数据
	//定义两个指针，一个在前，一个在后
	LPNODE LeftNode = list->headNode;
	LPNODE posNode = list->headNode->next;
	while (posNode != NULL && posNode->data.index < data.index) {
		LeftNode = posNode;
		posNode = posNode->next;
	}
	//找到比目标数值大的数据就插入在该数据的前面，没找到就插在尾处
	LPNODE newNode = CreateNewNode(data);
	assert(newNode);
	LeftNode->next = newNode;
	newNode->next = posNode;
	list->sqlistSize++;
}

打印链表

void printList(LPLIST list) {//输出数据
	LPNODE pMove = list->headNode->next;
    printf("序号\t数值\n");
	while (pMove) {
		printf("%d\t%d\n", pMove->data.index,pMove->data.mmData);
		pMove = pMove->next;
	}
	printf("\n");
}

测试代码

int main() {
	LPLIST list = CreateList();
	Data array[4] = { {1,3},{4,6},{3,7},{8,4} };
	for (int i = 0; i < 4; i++)
		insertBysqlist(list, array[i]);
	printList(list);
	return 0;
}

效果如下：