首页 > 代码库 > Problem Linked List Cycle
Problem Linked List Cycle
Problem Description:
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
Solution:
1 public boolean hasCycle(ListNode head) { 2 if (head == null) return false; 3 if (head.next == null || head.next.next == null) return false; 4 ListNode tortoise = head.next; 5 ListNode hare = head.next.next; 6 while (tortoise != hare) { 7 if (tortoise.next == null) return false; 8 tortoise = tortoise.next; 9 if (hare.next == null || hare.next.next == null) return false;10 hare = hare.next.next;11 }12 13 return true;14 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。