首页 > 代码库 > [LeetCode]142 Linked List Cycle II
[LeetCode]142 Linked List Cycle II
https://oj.leetcode.com/problems/linked-list-cycle-ii/
http://blog.csdn.net/linhuanmars/article/details/21260943
/** * 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) return null; ListNode one = head; ListNode two = head; ListNode meet = null; while (one != null && two != null) { one = one.next; two = two.next; if (two == null) return null; else two = two.next; if (one == two) { meet = one; break; } } if (meet == null) return null; // no cicle. one = head; while (one != two) { one = one.next; two = two.next; } return one; } }
[LeetCode]142 Linked List Cycle II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。