// c program to check if a linked list is circular
struct Node {
int data ;
struct Node* next ;
};
typedef Node* Node ;
int isCircularLinkedList(Node head)
{
Node slowPtr = fastPtr = head ;
while (slowPtr && fastPtr )
{
slowPtr = slowPtr->next ;
fastPtr = fastPtr -> next;
if( ! fastPtr )
{
return 0 ;
}
else {
fastPtr = fastPtr - > next ;
}
if( slowPtr = fastPtr )
return 1 ;
}
return 0 ;
}
struct Node {
int data ;
struct Node* next ;
};
typedef Node* Node ;
int isCircularLinkedList(Node head)
{
Node slowPtr = fastPtr = head ;
while (slowPtr && fastPtr )
{
slowPtr = slowPtr->next ;
fastPtr = fastPtr -> next;
if( ! fastPtr )
{
return 0 ;
}
else {
fastPtr = fastPtr - > next ;
}
if( slowPtr = fastPtr )
return 1 ;
}
return 0 ;
}
No comments:
Post a Comment