/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
void reorderList(ListNode* head) {
if(head==NULL)return;
vector<ListNode*>q;
ListNode*p=head;
while(p){
q.push_back(p);
p=p->next;
}
int i=0;int j=q.size()-1;
while(i<j){
q[i]->next=q[j];
i++;
if(i==j){
break;
}
q[j]->next=q[i];
j--;
}
q[i]->next=NULL;
}
};
143. 重排链表
最新推荐文章于 2024-09-13 16:27:15 发布