题目要求:
Given a linked list, determine if it has a cycle in it.
即给定一个链表,判断是否有环的存在
思路:定义一个快指针,一个慢指针,若两个指针相遇,则说明有环存在
/**
* 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 fast=head;
ListNode slow = head;
while(fast!=null && fast.next!=null)
{
slow = slow.next;
fast = fast.next.next;
if(slow == fast)
{
return true;
}
}
return false;
}
}