/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode detectCycle(ListNode head) {
if(head == null || head.next == null){
return null;
}
ListNode runner = head;
ListNode walker = head;
while(runner.next != null && runner.next.next != null){
runner = runner.next.next;
walker = walker.next;
if(runner == walker){
ListNode walker2 = head;
while(walker2 != walker){
walker2 = walker2.next;
walker = walker.next;
}
return walker;
}
}
return null;
}
}
142. 环形链表 II
最新推荐文章于 2023-05-07 16:02:45 发布