Middle of the Linked List

middle-linked.py

#https://leetcode.com/explore/challenge/card/30-day-leetcoding-challenge/529/week-2/3290/

class Solution(object):
    def middleNode(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        
        middle = head
        current = head.next
        i = 1

        if(head.next is None):
            return head

        while (current.next is not None):
            current = current.next
            i += 1
            if i % 2 == 0:
                middle = middle.next
        if i % 2 != 0:
            middle = middle.next 
        
        return middle