From : https://leetcode.com/problems/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.
For example,
Given 1->4->3->2->5->2
and x = 3,
return 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 *smalls = new ListNode(0);
ListNode *larges = new ListNode(0);
ListNode *p = head, *ps = smalls, *pl = larges;
while(p) {
if(p->val < x) {
ps->next = p;
ps = p;
} else {
pl->next = p;
pl = p;
}
p = p->next;
}
ps->next = larges->next;
pl->next = NULL;
p = smalls->next;
delete smalls;
delete larges;
return p;
}
};
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode partition(ListNode head, int x) {
ListNode smalls = new ListNode(0), sp = smalls;
ListNode larges = new ListNode(1), lp = larges;
ListNode p = head;
while(p != null) {
if(p.val < x) {
sp = sp.next = p;
} else {
lp = lp.next = p;
}
p = p.next;
}
sp.next = larges.next;
lp.next = null;
return smalls.next;
}
}
忘记将链表尾致空是很危险的。