int LoopNodeNum(Node *head)
{
Node *fast=NULL,*slow=NULL;
fast=slow=head;
while(fast!=NULL && fast->next!=NULL)
{
slow = slow->next;
fast=fast->next;
if(slow==fast)
break;
}
if(fast ==NULL && fast->next==NULL)//该链表无环
return -1;
int count=0;//计数器
Node *p=slow;
do
{
count++;
slow = slow->next;
fast=fast->next->next;
}while(slow!=fast);
return count;
}