判断链表中是否有环
//判断给定的链表中是否有环
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool hasCycle(ListNode *head) {
if (head == nullptr || head->next == nullptr)
return false;
ListNode* slow = head;
ListNode* fast = head;
do {
if (slow != nullptr && fast != nullptr && fast->next != nullptr)
{
slow = slow->next;
fast = fast->next->next;
}
else
break;
} while (slow != fast);
if (slow == nullptr || fast == nullptr || fast->next == nullptr)
return false;
else
return true;
}
};