876 链表中间节点

最新推荐文章于 2024-10-20 09:49:14 发布

anqin2712

最新推荐文章于 2024-10-20 09:49:14 发布

阅读量61

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/INnoVationv2/p/10260528.html

版权

  ListNode* middleNode(ListNode* head) {
        ListNode* slow = head;
        ListNode* fast = head;
        while (fast != NULL && fast->next != NULL) {
            slow = slow->next;
            fast = fast->next->next;
        }
        return slow;
    }

自己写的不够简洁

ListNode *middleNode(ListNode *head) {
    if (head == nullptr || head->next == nullptr)
        return head;
    ListNode *slow = head, *fast = head->next;
    while (fast->next != nullptr) {
        fast = fast->next;
        slow = slow->next;
        if (fast->next == nullptr)
            return slow;
        fast = fast->next;
    }
    return slow->next;
}

转载于:https://www.cnblogs.com/INnoVationv2/p/10260528.html