package p3.链式结构;
public class Solution141 {
public boolean hasCycle(ListNode head) {
if (head == null || head.next == null) {
return false;
}
ListNode p = head;
ListNode q = head;
while (q.next != null && q.next.next != null) {
p = p.next;
q = q.next.next;
if (p == q) {
return true;
}
}
return false;
}
}
Leetcode141. 环形链表
最新推荐文章于 2024-10-11 19:43:29 发布