class Solution {
public:
ListNode* middleNode(ListNode* head) {
ListNode *p = head;
int n = 0;
while (p != NULL) {
p = p->next;
++n;
}
int k = n / 2 ;
p = head;
while (k) {
--k;
p = p->next;
}
return p;
}
};
876. Middle of the Linked List
最新推荐文章于 2025-06-30 00:59:03 发布