链表面试进阶

1.判断单链表是否带环？若带环，求环的长度？求环的入口点？ int IsCycle(Node* p) { Node* slow, *fast; fast = slow = p; slow = slow->next; fast = fast->next->next; while （(fast != NULL) ||(fast->nest != NULL)）  { slow = slow->next;

>>阅读原文<<