876

876. Middle of the Linked List (Easy)

Given the head of a singly linked list, return the middle node of the linked list.

If there are two middle nodes, return the second middle node.

 

Example 1:

Input: head = [1,2,3,4,5]
Output: [3,4,5]
Explanation: The middle node of the list is node 3.

Example 2:

Input: head = [1,2,3,4,5,6]
Output: [4,5,6]
Explanation: Since the list has two middle nodes with values 3 and 4, we return the second one.

 

Constraints:

• The number of nodes in the list is in the range [1, 100].
• 1 <= Node.val <= 100

Companies:
Amazon, Apple, Microsoft, Adobe, Goldman Sachs

Related Topics:
Linked List, Two Pointers

Similar Questions:

• Delete the Middle Node of a Linked List (Medium)

Solution 1. Two Pointers

// OJ: https://leetcode.com/problems/middle-of-the-linked-list/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
    ListNode* middleNode(ListNode* head) {
        auto slow = head, fast = head;
        while (fast && fast->next) {
            slow = slow->next;
            fast = fast->next->next;
        }
        return slow;
    }
};