有序連結清單的建構

頭檔案

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

效果如下：