鏈表面試進階

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;

>>阅读原文<<