Download Linked List Cycle II.py
# Definition for singly-linked list. # class ListNode(object): # def __init__(self, x): # self.val = x # self.next = None class Solution(object): def detectCycle(self, head): """ :type head: ListNode :rtype: ListNode """ # Two points # https://discuss.leetcode.com/topic/2975/o-n-solution-by-using-two-pointers-without-change-anything try: fast = head.next.next slow = head.next while fast != slow: fast = fast.next.next slow = slow.next except: return None slow = head while fast != slow: fast = fast.next slow = slow.next return fast
Leetcode 142 Linked List Cycle II problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.