# problem0141

package
Version: v0.0.0-...-db5e768 Latest Latest

This package is not in the latest version of its module.

Go to latest
Published: Jul 25, 2019 License: MIT

## README ¶

### 141. Linked List Cycle

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:

``````Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.
``````

Example 2:

``````Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.
``````

Example 3:

``````Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.
``````

Follow up:

• Can you solve it using O(1) (i.e. constant) memory?

## Documentation ¶

### Constants ¶

This section is empty.

### Variables ¶

This section is empty.

### Functions ¶

This section is empty.

### Types ¶

#### type ListNode ¶

`type ListNode = kit.ListNode`

ListNode is pre-defined...

## Keyboard shortcuts

 ? : This menu / : Search site f or F : Jump to t or T : Toggle theme light dark auto y or Y : Canonical URL