单向循环链表

// 单向循环链表.cpp : 定义控制台应用程序的入口点。
//


#include "stdafx.h"
#include<iostream>
#include "CLinkList.h"
using namespace std;

int _tmain(int argc, _TCHAR* argv[])
{
int a[]={1,2,3,4,5};
int n=5;
/*测试空链表*/
CLinkList<int> clist_a;
clist_a.PrintList();
/*测试用数组初始化的链表*/
CLinkList<int> clist(a,n);
cout << "用数组初始化后：";
clist.PrintList();
/*删除操作*/
clist.Delete(4);
cout << "删除后：" ;
clist.PrintList();
/*插入操作*/
clist.Insert(100,5);
cout << "插入后：" ;
clist.PrintList();
int i=6;
cout << "位置" << i << "的元素等于: " << clist.Get(i) << endl;
int x=100;
cout << "元素" << x << "位于" << clist.Locate(x) << endl;

return 0;
}

template<class T>
struct Node
{
T data;
Node<T> *next;
};


template<class T>
class CLinkList
{
public:
CLinkList();
CLinkList(T a[], int n);
//~CLinkList();
void PrintList();
void Insert(T x, int i);
void Delete(int i);
int Locate(T x);
T Get(int i);
private:

Node<T> *rear;
};


template<class T>
CLinkList<T>::CLinkList()
{
rear= new Node<T>; 
rear->next=rear;
}


template<class T>
CLinkList<T>::CLinkList(T a[], int n) //尾插法
{
rear = new Node<T>;
rear->next=rear;
int i;
for(i=0;i<n;i++)
{
Node<T> *p = new Node<T>;
p->data = a[i];
p->next = rear->next;
rear->next = p;
rear = p;
}
}


template<class T>
void CLinkList<T>::PrintList()
{
Node<T> *p = rear->next;
if(p==rear) 
{ cout << "单循环链表为空" << endl;
//exit(0);
}
else
{
while(p != rear)
{
cout << p->next->data << "  ";
p = p->next;
}
cout << endl;
}
}


template<class T>
void CLinkList<T>::Delete(int i)
{
Node<T> *p = rear->next;
int j=0;
if(i<1)
{
cout << "i必须大于等于1" << endl;
//exit(0);
}
else
{
while(j<i-1 && p!=rear)
{
p = p->next;
j++;
}
if(p==rear) throw "位置错误，没有这么多元素";
if(p->next==rear)//删除rear节点的情况
{
Node<T> *s = p->next;
p->next = s->next;
rear = p;     //修改rear指针
delete s;
}
else         //删除一般节点的情况
{
Node<T> *s = p->next;
p->next = s->next;
delete s;
}
}
}


template<class T>
void CLinkList<T>::Insert(T x,int i)
{
if(i<1) {cout << "i必须大于等于1！" << endl;exit(0);}
if(i==1)
{
Node<T> *p = new Node<T>;
p->data=x;
p->next=rear->next->next;
rear->next->next=p;

}
else
{
Node<T> *p = rear->next->next;;
int j=1;
while(j<i-1 && p!=rear->next)
{
p = p->next;
j++;
}
if(p==rear->next)
{
cout << "插入位置错误" << endl;
//throw "插入位置错误";
exit(0);
}
//if(p==rear) cout<< "haha "; 
Node<T> *s = new Node<T>;
s->data = x;
s->next = p->next;
p->next = s;
if(p==rear) rear=s;
}
}


template<class T>
T CLinkList<T>::Get(int i)
{
Node<T> *p = rear->next;
int j=0;
while(j<i-1 && p!=rear)
{
p = p->next;
j++;
}
if(p==rear)
{ cout << "位置错误: " << i << "太大！" ;
//exit(-1);
return -1;
}
 
return p->next->data;
}


template<class T>
int CLinkList<T>::Locate(T x)
{
Node<T> *p = rear->next->next;
int j = 1;
while(p->data!=x && p!=rear->next)
{
p = p->next;
j++;
}
if(p==rear->next){cout << "元素不存在！" << endl;exit(0);}
return j;
}

错误和心得：

1，void CLinkList();

    void CLinkList(T a[], int n);

2，CLinkList clist(a,n);         报错  “error：缺少 类模版"CLinkLis"t 参数列表”

     应改为CLinkList<int> clist(a,n);   这也说明了模版的类型参数化。

3，下面构造函数的红色字体部分没写，导致位置冲突

CLinkList<T>::CLinkList(T a[], int n) //尾插法
{
rear = new Node<T>;
rear->next=rear;初始化是必须的，无参构造函数与有参构造函数是独立的。所以这两个语句不能丢
int i;
for(i=0;i<n;i++)
{
Node<T> *p = new Node<T>;
p->data = a[i];
p->next = rear->next;
rear->next = p;
rear = p;
}
}

4，在处理哨兵时，应该采取“临界法”，把第一个不符合的情况作为哨兵，比如

T CLinkList<T>::Get(int i)
{
Node<T> *p = rear->next;
int j=0;
while(j<i-1 && p!=rear)  //红色字体是哨兵，配合后面红色的if语句完成哨兵功能
{
p = p->next;
j++;
}
if(p==rear)
{ cout << "位置错误: " << i << "太大！" ;
//exit(-1);
return -1;
}
 
return p->next->data;
}

运行结果：