[数据结构]循环链表及其基本操作 原创

/*
 * @Author: 
 * @data: 2019-12-03 19:47:29 
 * @Last Modified by: 
 * @Last Modified time: 2019-12-03 20:00:06
 */

#include <iostream>
#include <cstdio>

using namespace std;

typedef int Status;
typedef int Elem;

typedef struct LNode
{
	/* data */
	Elem data;
	struct LNode *next;
} LNode, *LinkList;

//初始化
Status InitList(LinkList &L)
{
	L = new LNode;
	L->next = NULL;
	return 1;
}

//遍历
Status ShowList(LinkList &L)
{
	//循环链表 特征！
 	LNode *q = L->next;
	while(q->next)
	{
		q = q->next;
	}
	q->next = L->next; 
 
	LNode *p = L->next;
	while (p)
	{
		cout << p->data << " ";
		p = p->next;
	}

	return 1;
}

//创建
Status CreatList_H(LinkList &L, int num)
{
	L = new LNode;
	L->next = NULL;

	for (int i = 0; i < num; i++)
	{
		LNode *p = new LNode;
		cin >> p->data;

		p->next = L->next;
		L->next = p;
	}

	return 1;
}

int main()
{
	LinkList L;

	int num;
	cin >> num;
	CreatList_H(L, num);

	//1
	ShowList(L);
}