package com.app.main.LeetCode;
import com.app.main.LeetCode.base.ListNode;
/**
* Created with IDEA
* author:Dingsheng Huang
* Date:2019/6/29
* Time:下午9:04
* 题目信息:
* level = easy
* id = 141
* 判断链表是否有环
*/
public class LinkedListCycle {
/**
* 思路:
* 快慢指针
* @param head
* @return
*/
public boolean hasCycle(ListNode head) {
if (head == null) {
return false;
}
// 快慢指针
ListNode fastNode = head;
ListNode slowNode = head;
while (fastNode.next != null) {
slowNode = slowNode.next;
fastNode = fastNode.next.next;
if (fastNode == null) {
return false;
}
if ( slowNode.val == fastNode.val) {
return true;
}
}
return false;
}
}