/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* partition(ListNode* head, int x) {
ListNode* dummy=new ListNode(-1); //哑结点
ListNode* large=new ListNode(-1); //大于等于x的链表large
ListNode* save=large; //保留large的头指针
dummy->next=head;
ListNode*p=dummy;
while(p->next){
if(p->next->val<x){
p=p->next;
}
else{
large->next=p->next;
p->next=p->next->next;
large=large->next;
large->next=NULL;
}
}
p->next=save->next;
return dummy->next;
}
};
86. 分隔链表
最新推荐文章于 2024-05-15 06:55:05 发布