Find/Detect the cycle of Linked List?
Sigiloso
bool hasCycle(ListNode *head) { ListNode* slow; ListNode* fast; slow=head; fast=head; while(fast!=NULL && fast->next!=NULL) { slow=slow->next; fast=fast->next->next; if(slow==fast) return true; } return false; }