Given a linked list, determine if it has a cycle in it.
To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.
Example 1:
Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.
Example 2:
Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.
Example 3:
Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.
Follow up:
Can you solve it using O(1) (i.e. constant) memory?
方法一：双指针
1、一个指针移动一步，一个指针移动两步，如果两个指针相遇则有环。
2、做任何题，第一个应该想的是鲁棒性
141. Linked List Cycle（判断l链表是否有环）（leetcode）
原文：https://www.cnblogs.com/shaer/p/10419736.html