Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of the two partitions.
For example,
Given 1->4->3->2->5->2
and x = 3,
return 1->2->2->4->3->5
.
Difficulty:Medium
ListNode* partition(ListNode* head, int x) {
if(head==NULL)
return head;
ListNode* head1 = new ListNode(0);
ListNode* pre = head1;
ListNode* p = head;
while(p!=NULL)
{
if(p->val<x)
{
ListNode* curr = new ListNode(p->val);
pre->next = curr;
pre = curr;
}
p = p->next;
}
p = head;
while(p!=NULL)
{
if(p->val>=x)
{
ListNode* curr = new ListNode(p->val);
pre->next = curr;
pre = curr;
}
p = p->next;
}
p = head1->next;
head1->next = NULL;
return p;
}