本文主要是介绍LeetCode [链表] 141.Linked List Cycle （C++和Python实现），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
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.
这篇关于LeetCode [链表] 141.Linked List Cycle （C++和Python实现）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
