# 清风的技术小屋

0%

## 问题描述

Given a linked list, determine if it has a cycle in it.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Example 1:

Example 2:

Example 3:

Can you solve it using O(1) (i.e. constant) memory?
Related Topics: Linked List, Two Pointers