题目链接 https://leetcode-cn.com/problems/middle-of-the-linked-list/ 解题思路 设置两个指针p,q。每次p走一步,q走两步这样当q走到链表末尾的时候,p正好是链表的中间结点 AC代码 class Solution { public ListNode middleNode(ListNode head) { ListNode p = head, q = head; while (q != null && q.next != null) { p = p.next; q = q.next.next; } return p; } }