文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
1. Description
Middle of the Linked List
2. Solution
/**
* 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) {
return head;
}
ListNode* p1 = head;
ListNode* p2 = head;
ListNode* pre = nullptr;
while(p2 && p2->next) {
p1 = p1->next;
p2 = p2->next->next;
}
return p1;
}
};
