两个链表less,指向所有小于x的;beq链表为所有大于等于x的
不断改变指针的指向,最后将链表合并,避免合并时候出现circle
/**
* 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 node1(21),node2(21);
ListNode *less=&node1;
ListNode *beq=&node2;
while(head!=NULL)
{
if(head->val<x)
{
less->next=head;
less=less->next;
}
else
{
beq->next=head;
beq=beq->next;
}
head=head->next;
}
beq->next=NULL;//避免死循环
less->next=node2.next;
return node1.next;
}
};
/**
* 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* less=new ListNode(0);
ListNode *biger=new ListNode(0);
ListNode* less_copy=less;
ListNode* biger_head=biger;
while(head!=NULL)
{
if(head->val<x)
{
ListNode *temp=new ListNode(head->val);
less->next=temp;
less=less->next;
}
else
{
ListNode *temp=new ListNode(head->val);
biger->next=temp;
biger=biger->next;
}
head=head->next;
}
less->next=biger_head->next;
return less_copy->next;
}
};