Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
解法一:不用任何额外空间去做。
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public boolean hasCycle(ListNode head) {
if(head==null||head.next==null) return false;
ListNode slow=head;
ListNode fast=head.next;
while(fast!=slow){
if(fast==null||fast.next==null) return false;
fast=fast.next.next;
slow=slow.next;
}
return true;
}
}
解法二:hash表来做
public boolean hasCycle(ListNode head) {
Set<ListNode> nodesSeen = new HashSet<>();
while (head != null) {
if (nodesSeen.contains(head)) {
return true;
} else {
nodesSeen.add(head);
}
head = head.next;
}
return false;
}