876. Middle of the Linked List

我会带着你远行 2022-03-25 05:37 145阅读 0赞

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`.

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

发表评论取消回复

表情：

评论列表（有 0 条评论，145人围观）

还没有评论，来说两句吧...

相关阅读

相关【LeetCode】21. Middle of the Linked List· 链表的中间节点

题目描述英文版描述 Given the head of a singly linked list, return the middle node of the l

太过爱你忘了你带给我的痛/ 2024年04月06日 14:08/ 0 赞/ 62 阅读

相关 LeetCode（Linked List)876. Middle of the Linked List

1.问题 Given the head of a singly linked list, return the middle node of the linked lis

柔情只为你懂/ 2023年09月24日 20:23/ 0 赞/ 128 阅读

相关 Intersection of Two Linked Lists--LeetCode

Write a program to find the node at which the intersection of two singly linked lists be

ゞ浴缸里的玫瑰/ 2022年08月07日 12:58/ 0 赞/ 151 阅读

相关 LeetCode-Intersection of Two Linked Lists

题目 Write a program to find the node at which the intersection of two singly linked list

雨点打透心脏的1/2处/ 2022年08月06日 13:22/ 0 赞/ 131 阅读

相关 LeetCode160—Intersection of Two Linked Lists

原题 [原题链接][Link 1] > Write a program to find the node at which the intersection of tw

小咪咪/ 2022年07月15日 12:26/ 0 赞/ 101 阅读

相关 [leetcode]: 160. Intersection of Two Linked Lists

1.题目 Write a program to find the node at which the intersection of two singly linked

朴灿烈づ我的快乐病毒、/ 2022年06月13日 23:00/ 0 赞/ 145 阅读

相关 Flux Dispatch.dispatch(…): Cannot dispatch in the middle of a dispatch

在使用flux进行数据交互的时候，出现了一个问题`Flux Dispatch.dispatch(…): Cannot dispatch in the middle of a d

忘是亡心i/ 2022年05月30日 03:09/ 0 赞/ 289 阅读

相关 876. Middle of the Linked List

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

我会带着你远行/ 2022年03月25日 05:37/ 0 赞/ 146 阅读

相关 160. Intersection of Two Linked Lists

Write a program to find the node at which the intersection of two singly linked lists be

冷不防/ 2021年11月29日 18:44/ 0 赞/ 194 阅读

相关 Who's in the Middle

Description FJ is surveying his herd to find the most average cow. He wants to know how

た入场券/ 2021年06月24日 13:58/ 0 赞/ 263 阅读