单循环链表（纯C语言实现）

单循环链表（带头结点、头节点数据域为节点数）

#include <stdio.h>
#include <stdlib.h> //开辟空间需要包含此头文件
//定义单循环链表节点结构体，包含数据域和next指针域
typedef struct Node {
	int data;
	struct Node* next;
}Node;
//初始化单循环链表，及初始化头节点并返回指向头节点结构体的指针
Node* initLoopLinkList() {
	Node* list = (Node*)malloc(sizeof(Node));
	list->data = 0;
	list->next = list;
	return list;
}
//头插法函数
void headPush(Node* list,int data) {
	Node* n = (Node*)malloc(sizeof(Node));
	n->data = data;
	n->next = list->next;
	list->next = n;
	list->data++;
}
//尾插法函数
void tailPush(Node* list, int data) {
	Node* n = (Node*)malloc(sizeof(Node));
	n->data = data;
	n->next = list;
	Node* temp = list;
	for (int i = 0; i < list->data; i++) {
		temp = temp->next;
	}
	temp->next = n;
	list->data++;
}
//删除指定值的函数
int delete(Node* list,int data) {
	Node* pre = list;
	Node* cur = list->next;
	while (cur != list) {
		if (cur->data == data) {
			pre->next = cur->next;
			free(cur);
			list->data--;
			return 1;
		}
		else {
			pre = cur;
			cur = cur->next;
		}
	}
	return 1;
}
//打印节点数据域的函数
void print(Node* list) {
	Node* temp = list;
	while (temp->next != list) {
		printf("%d ", temp->next->data);
		temp = temp->next;
	}
	printf("\n");
}
//测试函数
void test() {
	Node* list = initLoopLinkList();
	headPush(list, 5);
	headPush(list, 6);
	headPush(list, 7);
	print(list);
	tailPush(list, 1);
	tailPush(list, 3);
	tailPush(list, 2);
	print(list);
	delete(list, 3);
	print(list);
	delete(list, 6);
	print(list);
}
int main() {
	test();
	return 0;
}