876. 链表的中间结点--PYTHON

自己1：没啥好说的，代码也很简单

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

class Solution(object):
    def middleNode(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """

        slow = fast = head #设置快慢指针，慢的一次移动一个元素，快的一次移动两个指针
        
        while True:
            if not fast.next:#奇数元素情况         
                return slow
            elif not fast.next.next: #偶数情况
                return slow.next
            fast = fast.next.next
            slow = slow.next