//876. 链表的中间结点
class Solution {
public:
ListNode* middleNode(ListNode* head) {
if (head == NULL || head->next == NULL) return head;
auto p = head;
auto q = head->next;
while (q != NULL) {
p = p->next;
q = q->next;
if (q == NULL) break;
q = q->next;
}
return p;
}
};
LeetCode876. 链表的中间结点
最新推荐文章于 2024-10-16 10:13:45 发布