Time: 54 ms (14.68%), Space: 13.9 MB (91.10%) - LeetHub

Author: ataslim0343

876-middle-of-the-linked-list/876-middle-of-the-linked-list.py

@@ -1,31 +1,15 @@
 # Definition for singly-linked list.
-# class ListNode(object):
+# class ListNode:
 # def __init__(self, val=0, next=None):
 # self.val = val
 # self.next = next
-class Solution(object):
- def middleNode(self, head):
- """
- :type head: ListNode
- :rtype: ListNode
- """
- node=head
- n=0
- while(head):
- n+=1
- head=head.next
- print(n)
- if(n%2==0):
- p=n//2
- while(p):
- node=node.next
- p-=1
- return node
- else:
- p=(n//2)+1
- while(p-1):
- node=node.next
- p-=1
- return node
+class Solution:
+ def middleNode(self, head: Optional[ListNode]) -> Optional[ListNode]:
+ slow=head
+ fast=head
+ while(fast and fast.next):
+ slow=slow.next
+ fast=fast.next.next
+ return slow