首页 > 代码库 > 142. Linked List Cycle II
142. Linked List Cycle II
https://leetcode.com/problems/linked-list-cycle-ii/#/description
public ListNode detectCycle(ListNode head) { if (head == null) { return null; } ListNode fast = head; ListNode slow = head; do { if (fast == null || fast.next == null) { return null; } fast = fast.next.next; slow = slow.next; } while (fast != slow); fast = head; while (fast != slow) { fast = fast.next; slow = slow.next; } return fast; }
142. Linked List Cycle II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。