leetcode-partition-list

partition-list

---

描述

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

要点

partition 链表 将比他小的放在前面，比它大的放在后面。
用两个链表将他们数分层两组

解决

class Solution {
public:
ListNode* partition(ListNode* head, int x) {
ListNode *l = new ListNode(0);
ListNode *r = new ListNode(0);
ListNode *l1 = nullptr;
ListNode *r1 = nullptr;
l1 = l;
r1 = r;
while(head){
if(head->val<x){
l1->next = new ListNode(head->val);
l1=l1->next;
}
else{
r1->next = new ListNode(head->val);
r1=r1->next;
}
head=head->next;
}
l1->next=r->next;
return l->next;
}
};
struct ListNode{
int val;
ListNode *next;
ListNode(int x) : val(x),next(NULL){}
};