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.
Example:
Input: head = 1->4->3->2->5->2, x = 3
Output: 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) {
ListNode* ph,*qh,*p,*q,*ptr;//ph,qh分别是前段和后段的头结点,ptr为当前结点
ph=new ListNode(0);
qh=new ListNode(0);
p=ph;
q=qh;
ptr=head;
while(ptr)
{
if(ptr->val<x)//前段
{
p->next=ptr;
p=ptr;
ptr=ptr->next;
p->next=nullptr;
}
else//后段
{
q->next=ptr;
q=ptr;
ptr=ptr->next;
q->next=nullptr;
}
}
p->next=qh->next;//将两段连接起来
return ph->next;
}
};
partition | 分割 |
---|