FilesExpand file tree

 main

/

Linked_List_Cycle_II.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

13 lines (12 loc) · 427 Bytes

 main

/

Linked_List_Cycle_II.py

Copy path

Top

File metadata and controls

• Code
• Blame

13 lines (12 loc) · 427 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

#LeetCode problem link: https://leetcode.com/problems/linked-list-cycle-ii/

class Solution:

def detectCycle(self, head: ListNode) -> ListNode:

node = head

val_holder = []

while(node.next is not None):

temp = node.val

val_holder.append(temp)

if node.next.val not in val_holder:

node = node.next

else:

return node.next