Linked List Cycle
Posted YuriFLAG
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Linked List Cycle相关的知识,希望对你有一定的参考价值。
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
1 /** 2 * Definition for ListNode. 3 * public class ListNode { 4 * int val; 5 * ListNode next; 6 * ListNode(int val) { 7 * this.val = val; 8 * this.next = null; 9 * } 10 * } 11 */ 12 public class Solution { 13 /** 14 * @param head: The first node of linked list. 15 * @return: True if it has a cycle, or false 16 */ 17 public boolean hasCycle(ListNode head) { 18 if (head == null || head.next == null) { 19 return false; 20 } 21 ListNode slow = head; 22 ListNode fast = head.next; 23 while (fast != null && fast.next != null) { 24 slow = slow.next; 25 fast = fast.next.next; 26 if (fast == slow) { 27 return true; 28 } 29 } 30 return false; 31 } 32 }
以上是关于Linked List Cycle的主要内容,如果未能解决你的问题,请参考以下文章
算法分析如何理解快慢指针?判断linked list中是否有环找到环的起始节点位置。以Leetcode 141. Linked List Cycle, 142. Linked List Cycl(代码