README
¶
Solutions using Two Pointer
- 11. Container With Most Water
- 19. Remove Nth Node from End of List
- 42. Trapping Rain Water
- 53. Maximum Subarray
- 75. Sort Colors
- 82. Remove Duplicates from Sorted List II
- 92. Reverse Linked List II
- 103. Binary Tree Zigzag Level Order Traversal
- 121. Best Time to Buy and Sell Stock
- 141. Linked List Cycle
- 143. Reorder List
- 160. Intersection of Two Linked Lists
- 189. Rotate Array
- 234. Palindrome Linked List
- 238. Product of Array Except Self
- 283. Move Zeroes
- 763. Partition Labels
- 876. Middle of the Linked List
Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func HasCycle ¶
141. Linked List Cycle
Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter. Return true if there is a cycle in the linked list. Otherwise, return false.
Runtime: 9 ms, faster than 87.26% of Go online submissions for Linked List Cycle. Memory Usage: 4.4 MB, less than 31.25% of Go online submissions for Linked List Cycle.
Types ¶
Source Files
Click to show internal directories.
Click to hide internal directories.