循环链表的实现 C++

自己写的一个实现循环链表的小程序，功能不是特别多，实现了一些最基本的方法。

// circleList.cpp : 实现循环链表
//

#include "stdafx.h"
#include <iostream>

using namespace std;

//定义节点
class Node
{
public:
	int data;
	Node *next;
};

//创建循环链表模板
class circlelist
{
public:
	circlelist();
	~circlelist();
	void createList();
	void travelList();
	int deleteList(int index);
	int insertList(int index, int x);
	int 

private:
	Node *head;
};

//构造函数，初始化循环链表
circlelist::circlelist()
{
	//创建一个指向自己本身的结点
	head = new Node();
	head->data = 0;
	head->next = head;
	printf("这里是构造函数，初始化链表\n");
}

//析构函数
circlelist::~circlelist()
{
	delete head;
	printf("这里是析构函数\n");
}

//创建循环链表
void circlelist::createList()
{
	Node *p,*q;
	p = head;
	printf("请输入链表的长度:");
	int n;
	cin >> n;
	int data;
	if (n==0)
	{
		printf("结束创建\n");
		return;
	}
	else
	{
		for (size_t i = 1; i <= n; i++)
		{
			q = (Node*)malloc(sizeof(Node));
			printf("请输入第%d个链表的数据:", i);
			cin >> data;
			q->data = data;
			p->next = q;
			q->next = head;
			p = q;
		}
		return;
	}
}

//遍历链表
void circlelist::travelList()
{
	Node *p;
	p = head;
	int n = 1;
	printf("头结点的数据是：%d\n", p->data);
	while (p->next!=head)
	{
		p = p->next;
		printf("第%d个结点的数据是：%d\n", n,p->data);
		n++;
	}
}

//删除链表第index个元素，如果index不存在，则返回-1
int circlelist::deleteList(int index)
{
	Node *p;
	p = head;
	int n = 0;
	while (p->next!=head)
	{
		n++;
		if (index==n)
		{
			p->next = p->next->next;
			printf("删除成功！\n");
			return 0;
		}
		p = p->next;
	}
	if (index>n)
	{
		printf("所删除元素超出链表长度！\n");
		return -1;
	}
}

//在第index个位置之前插入数据val，如果index超出长度，则不会插入链表，index等于链表长度，则插在最末尾
int circlelist::insertList(int index, int x)
{
	Node *p,*q;
	p = head;
	int n = 0;
	while (p->next!=head)
	{
		p = p->next;
		n++;
	}
	int length = n;
	if (index<length)
	{
		p = head;
		int n = index;
		while (--n)//此处要用--n，先自减，再判断值
		{
			p = p->next;
		}
		q = (Node*)malloc(sizeof(Node));
		q->data = x;
		q->next = p->next;
		p->next = q;
		return 1;
	}
	if (index==length)
	{
		p = head;
		int n = index;
		while (n)
		{
			p = p->next;
			n--;
		}
		q = (Node*)malloc(sizeof(Node));
		q->data = x;
		q->next = p->next;
		p->next = q;
		return 2;
	}
	if (index >length)
	{
		return 0;
	}
	return 0;
}


int main()
{
	circlelist List;
	List.createList();
	List.travelList();
	printf("输入要删除链表的元素：");
	int x;
	cin >> x;
	List.deleteList(x);
	List.travelList();
	printf("选择在第几个结点前插入链表：");
	int y;
	cin >> y;
	List.insertList(y, 99);
	List.travelList();
    return 0;
}