class Solution {
public:
ListNode* middleNode(ListNode* head) {
ListNode* fastnode = head;
ListNode*slownode = head;
while(fastnode->next && fastnode->next->next){
fastnode = fastnode->next->next;
slownode = slownode->next;
}
if(fastnode->next) slownode = slownode->next;
return slownode;
}
};
力扣:链表的中间节点
最新推荐文章于 2024-07-25 18:55:58 发布