node.h

判断链表中是否有循环 有的话

#include <iostream>
using namespace std;
/////结点类////
class Node {
public:
	int e;																//记录结点元素
	Node *next;															//记录下一结点地址
	Node (int elem,Node *nextVal){e=elem;next=nextVal;}
	Node (int elem){e=elem;next=NULL;}
	Node (){next=NULL;}
};