题解 | #重排链表#
重排链表
https://www.nowcoder.com/practice/3d281dc0b3704347846a110bf561ef6b
class Solution {
public:
void reorderList(ListNode *head) {
if(!head)return;
deque<ListNode*> deq;
ListNode* p = head;
while(p){
deq.push_back(p);
p = p->next;
}
p = head;
while(deq.size()>=3){
deq.front()->next = deq.back();
deq.pop_front();
deq.back()->next = deq.front();
deq.pop_back();
}
deq.back()->next = nullptr;
}
};
查看15道真题和解析