0876. Middle of the Linked List | LeetCode Cookbook

[halfrost]

https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List/

[baso4]

用官方的推荐的方法可以省略了后面的二次遍历更好一点。只是边界略不好理解一点

func middleNode(head *ListNode) *ListNode {
    slow,fast := head,head
    for fast != nil && fast.Next != nil {
        slow = slow.Next
        fast= fast.Next.Next
    }
    return slow
}