首页 > 代码库 > CC150 2.5
CC150 2.5
2.5 Given a circular linked list, implement an algorithm which returns node at the beginning of the loop. DEFINITION Circular linked list: A (corrupt) linked list in which a node’s next pointer points to an earlier node, so as to make a loop in the linked list. EXAMPLE input: A -> B -> C -> D -> E -> C (the same C as earlier) output: C
Node findCircle(Node head) { Node p1 = head; Node p2 = head; while (p2 != null) { if (p1 == p2) { break; } p1 = p1.next; p2 = p2.next; p2 = p2 == null ? null : p2.next; } if (p2 == null) return null; p1 = head; while (p1 != p2) { p1 = p1.next; p2 = p2.next; } return p1; }
CC150 2.5
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。