What is an efficient algorithm to find whether a singly linked list is circular/cyclic or not? [duplicate]

Question

How can I find whether a singly linked list is circular/cyclic or not? I tried to search but couldn't find a satisfactory solution. If possible, can you provide a pseudo-code or Java-implementation?

For instance:
1 → 3 → 5 → 71 → 45 → 7 → 5, where the second 5 is actually the third element of the list.

Answer 1

The standard answer is to take two iterators at the beginning, increment the first one once, and the second one twice. Check to see if they point to the same object. Then repeat until the one that is incrementing twice either hits the first one or reaches the end.

This algorithm finds any circular link in the list, not just that it's a complete circle.

Pseudo-code (not Java, untested -- off the top of my head)

bool hasCircle(List l) {    Iterator i = l.begin(), j = l.begin();    while (true) {       // increment the iterators, if either is at the end, you're done, no circle       if (i.hasNext())  i = i.next(); else return false;        // second iterator is travelling twice as fast as first       if (j.hasNext())  j = j.next(); else return false;       if (j.hasNext())  j = j.next(); else return false;        // this should be whatever test shows that the two       // iterators are pointing at the same place       if (i.getObject() == j.getObject()) {            return true;       }     } }