## https://leetcode.com/problems/middle-of-the-linked-list/s

class Solution(object):
    def middleNode(self, head):
        A = [head]
        while A[-1].next:
            A.append(A[-1].next)
        return A[int(len(A) / 2)]
98d72c1f9f97caf2b545ca1f471899bb047c6cfe
<mask token>

class Solution(object):
    <mask token>

class Solution(object):

    def middleNode(self, head):
        A = [head]
        while A[-1].next:
            A.append(A[-1].next)
        return A[int(len(A) / 2)]

## https://leetcode.com/problems/middle-of-the-linked-list/s

class Solution(object):
    def middleNode(self, head):
        A = [head]
        while A[-1].next:
            A.append(A[-1].next)
        return A[int(len(A) / 2)]