876. Middle of the Linked List
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.
解题思路:
/*
执行用时 : 0 ms, 在Middle of the Linked List的C提交中击败了100.00% 的用户
内存消耗 : 7 MB, 在Middle of the Linked List的C提交中击败了33.62% 的用户
*/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* middleNode(struct ListNode* head){
if(head == NULL || head->next == NULL){
return head;
}
struct ListNode* fast = head;
struct ListNode* slow = head;
//利用快慢指针
//链表结点个数为奇数时,slow指向中间结点;链表结点个数为偶数时,slow指向两中间结点的后一个
while(fast != NULL && fast->next != NULL){
slow = slow->next;
fast = fast->next->next;
}
return slow;
}
后记:
推荐阅读:
LeetCode 141. Linked List Cycle(环形链表) -- c语言