循环链表构建

循环链表无头节点构建

#include <stdio.h>
#include <stdlib.h>

typedef struct Node
{
	int data;
	struct Node* next;
}List, * pList;

pList insert_data(int n)
{
	pList p=NULL, q=NULL;

	for (int i = 1; i <= n; i++)
	{
		pList temp = (pList)malloc(sizeof(List));
		temp->data = i;
		temp->next = NULL;
		if (i == 1)
		{
			p = temp;
			q = temp;
		}
		else {
			q->next = temp;
			q = q->next;
		}
	}
	q->next = p;
	return p;

}
int main()
{
	pList list = insert_data(10);
	return 0;
}