leetcode-gulag/141-linked-list-cycle/soln.cpp

#include "soln.hpp"

bool Solution::hasCycle(ListNode *head)
{
	ListNode *slow = head, *fast = head;
	while (fast && fast->next)
	{
		slow = slow->next;
		fast = fast->next->next;
		if (slow == fast)
			return true;
	}
	return false;
}

bool Solution::test(ListNode *head, bool answer)
{
	return hasCycle(head) == answer;
}