def deleteNode(self, node: ListNode):
"""
:type node: ListNode
:rtype: void Do not return anything, modify node in-place instead.
"""
node.val = node.next.val
node.next = node.next.next
def push(self, item):
newNode = ListNode(item)
newNode.next = self._top
self._top = newNode
self._size += 1
if slow == fast:
firstMeetNode = slow
break
first = head
second = firstMeetNode
while first != second:
first = first.next
second = second.next
return first
head = ListNode(3)
n2 = ListNode(2)
n3 = ListNode(0)
n4 = ListNode(-4)
head.next = n2
n2.next = n3
n3.next = n4
n4.next = n2
# head.printLL();
s = Solution()
r = s.detectCycle(head)
print(r.val)