判断链表是否有环
方法一:用HashSet记录
方法二:快慢指针记录,快的走两步,慢的走一步,如果有环两者一定会相遇;
public boolean hasCycle(ListNode head) {
// 快慢指针 快的走2步 慢的走一步,两者总会汇合
if (head == null || head.next == null) {
return false;
}
ListNode slow = head;
ListNode fast = head;
while (fast != null && fast.next != null) {
slow = slow.next;
fast = fast.next.next;
if(slow == fast) {
return true;
}
}
return false;
}