876. Middle of the Linked List

876. Middle of the Linked List

---

题目

Leetcode题目

Given a non-empty, singly linked list with head node head, return a middle node of linked list.

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

Example 1:

Input: [1,2,3,4,5]
Output: Node 3 from this list (Serialization: [3,4,5])
The returned node has value 3.  (The judge's serialization of this node is [3,4,5]).
Note that we returned a ListNode object ans, such that:
ans.val = 3, ans.next.val = 4, ans.next.next.val = 5, and ans.next.next.next = NULL.

Example 2:

Input: [1,2,3,4,5,6]
Output: Node 4 from this list (Serialization: [4,5,6])
Since the list has two middle nodes with values 3 and 4, we return the second one.

Note:

• The number of nodes in the given list will be between 1 and 100.

---

解决

链表的节点数量为n。

1.确定节点数量以确定中间节点位置。

• 时间复杂度：O(n)
• 空间复杂度：O(1)

class Solution {
public:
    ListNode* middleNode(ListNode* head) {
        int size = countNode(head);
        int middle = ceil(size / 2);
        ListNode* temp = head;
        while (middle--) {
            temp = temp->next;
        }
        return temp;
    }

    // 计算链表节点数量
    int countNode(ListNode* head) {
        int n = 0;
        ListNode* temp = head;
        while (temp) {
            n++;
            temp = temp->next;
        }
        return n;
    }
};

2.利用指针遍历
使用两个指针来实现链表的遍历，一个指针步长为2，另一个指针步长为1。当步长为2的指针遍历完链表时，步长为1的指针刚刚到达链表的中间位置。

• 时间复杂度：O(n)
• 空间复杂度：O(1)

class Solution {
public:
    ListNode* middleNode(ListNode* head) {
        ListNode* temp = head;
        ListNode* result = head;
        while (temp && temp->next) {
            temp = temp->next->next;
            result = result->next;
        }
        return result;
    }
};