我用Java刷 leetcode 876. 链表的中间结点

Posted 2021-06-02 深林无鹿

这里有leetcode题集分类整理！！！

双指针AC：（O（n））

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode middleNode(ListNode head) {
        ListNode fast = head, slow = head;
        while (fast != null && fast.next != null) {
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }
}