给定一个链表和一个特定值 x,对链表进行分隔,使得所有小于 x 的节点都在大于或等于 x 的节点之前。
你应当保留两个分区中每个节点的初始相对位置。
示例:
输入: head = 1->4->3->2->5->2, x = 3
输出: 1->2->2->4->3->5
/**
* 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) {
if(!head ||!head->next)
return head;
ListNode* head1 = new ListNode(-1);
ListNode* small = head1;
ListNode* head2 = new ListNode(0);
ListNode* large = head2;
ListNode* p = head;
while(p)
if(p->val < x){
small->next = p;
p = p->next;
small = small->next;
small->next = NULL;
}
else{//p->val >= x
large->next = p;
p = p->next;
large = large->next;
large->next = NULL;
}
//large->next = NULL;
small->next = head2->next;
ListNode* resNode = head1->next;
delete head1, head2;
return resNode;
}
};