ListNode NodeOfLoop(ListNode head)
{
if(head == null || head.next == null)
{
return null;
}
ListNode slow = head;
ListNode fast = head;
while(fast != null && fast.next != null)
{
slow = slow.next;
fast = fast.next.next;
if(slow == fast)
{
ListNode p = head;
ListNode q = slow;
while(p != q)
{
p = p.next;
q = q.next;
}
return q;
}
}
return null;
}
数据结构--怎么判断链表有环,怎么找出环节点
最新推荐文章于 2024-04-01 14:57:16 发布