llist.h

来自「判断链表是否相交 若相交」· C头文件 代码 · 共 25 行

#include "Node.h"
#include <iostream>
using namespace std;
//////link/////////
class LList{
private:
	Node *head;
	void init(){							//initial the link
	 head = tail = fence = new Node();
	 length = 0;
	}
public:
	int length;
	Node *fence;	
	Node *tail;
	LList(){init();}
	bool append(int elem);					//add element in the last
	void setTail(Node *temp) {				//reset the tail ,make it intersect
	tail->next = temp;
	}
	int setEnd() {
		while(tail->next!=NULL){tail = tail->next;length++;}
		return length;
	}
};