LeetCode | 141. Linked List Cycle 寻找链表中的环，简单题

Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?

题目是判断链表里面是否有循环，可以使用快慢指针解决，实际上只要是判断循环的题目都可以使用快慢指针解决，

慢指针每一次走一格，快指针每一次走两格，当快指针为null的时候肯定不存在循环了，当链表中有循环则一定有一次循环会使得快指针等于慢指针

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