题意:获得链表中心结点。当有两个中心结点时,返回第二个。
分析:快慢指针。
/** * 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 *fast = head; ListNode *slow = head; while(fast && fast -> next){ fast = fast -> next -> next; slow = slow -> next; } return slow; } };
来源:https://www.cnblogs.com/tyty-Somnuspoppy/p/12376649.html