判断一个单向链表是否有环

struct node
{
struct *next;
};
typedef stuct node Node;

bool getCycle(){
Node* temp1 = head;//(假设head就是这个链表的头)
Node* temp2 = head;
while(head->next!=NULL)
{
temp1 = temp1->next;//步长为1
temp2 = temp2->next->next;//步长为2
if(temp1 == temp2)
return ture;
head=head->next;
}
return false;
}