给定一个链表,判断链表中是否有环。
进阶:
你能否不使用额外空间解决此题?
解答:
双指针法:
/**
* 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 (slow!=fast){
if (fast == null || fast.next == null) {
return false;
}
slow=slow.next;
fast=fast.next.next;
}
return true;
}
}