Python編程練習：Leetcode_876.鏈表中間節點_python3

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def middleNode(self, head: ListNode) -> ListNode:
        linklist=[head]

        while linklist[-1] and linklist[-1].next:
            linklist.append(linklist[-1].next)
        l=len(linklist)
        
        return linklist[l//2]