描述
根据值x划分链表,小于x的部分在前面,大于等于x的在后面,每个节点的相对顺序保持不变
解决
利用两个临时链表分别存两个子链表,最后把链表合在一起
/**
* 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)
return NULL;
ListNode head1(-1), head2(-1);
ListNode *head1_ptr = &head1, *head2_ptr = &head2;
while (head)
{
if (head -> val < x)
{
head1_ptr -> next = head;
head1_ptr = head1_ptr -> next;
}
else
{
head2_ptr -> next = head;
head2_ptr = head2_ptr -> next;
}
head = head -> next;
}
head1_ptr -> next = head2.next;
head2_ptr -> next = NULL;
return head1.next;
}
};