llist.cpp

来自「判断链表中是否有循环 有的话」· C++ 代码 · 共 44 行

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

bool LList:: append(int elem){
	tail=tail->next=new Node(elem);
	return true;
}

void LList::print(){
	Node *temp;
	temp = fence;
	do
	{
		cout << temp->e <<" ";			
		temp = temp ->next;	
	}while (temp!=fence);
}
////////////判断是否循环/////////
bool LList::circleInList()   
  {   
	  if(head == NULL || head->next == NULL)  
	  {   
		return false;   
	  }   
	  if(head->next == head)
	  {   
		  fence = head;
		  return true;   
	  }   
	  Node *pTemp1 = head;       //step   1   
	  Node *pTemp = head->next;  //step   2   
	  while(pTemp != pTemp1 && pTemp != NULL && pTemp->next !=  NULL)   
	  {   
		  pTemp1 = pTemp1->next;   
		  pTemp = pTemp->next->next;   
	  }   
	  if(pTemp == pTemp1)   
	  {   
		  fence = pTemp;
		  return true;   
	  }   
	  return false;   
  }