把小于val的数值尾插到一个链表,大于等于尾插到另一个链表,然后再链接起来。
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};*/
class Partition {
public:
ListNode* partition(ListNode* pHead, int x) {
struct ListNode* greaterGuard,*greaterTail,*lessGuard,*lessTail;
greaterGuard = greaterTail = (struct ListNode*)malloc(sizeof(struct ListNode));
lessGuard = lessTail = (struct ListNode*)malloc(sizeof(struct ListNode));
greaterTail->next = lessTail->next = NULL;
struct ListNode* cur = pHead;
while(cur)
{
if(cur->val < x)
{
lessTail->next = cur;
lessTail = lessTail->next;
}
else
{
greaterTail->next = cur;
greaterTail = greaterTail->next;
}
cur = cur->next;
}
lessTail->next = greaterGuard->next;
greaterTail->next = NULL;
pHead = lessGuard->next;
free(lessGuard);
free(greaterGuard);
return pHead;
}
};