[题目地址](https://leetcode.cn/problems/middle-of-the-linked-list) + 快慢指针寻找链表中位数 ```go /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ func middleNode(head *ListNode) *ListNode { slow, fast := head, head for fast != nil && fast.Next != nil{ slow = slow.Next fast = fast.Next.Next } return slow } ```