1.Description
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.
2.Example
输入: head = 1->4->3->2->5->2, x = 3
输出: 1->2->2->4->3->5
3.Solution
一开始想要使用双指针,没有写出来,以后有机会补上吧。
创建两个链表,before统计小于x的节点,after统计大于x的节点,最后把before和after连到一起。
class Solution {
public ListNode partition(ListNode head, int x) {
// before and after are the two pointers used to create the two list
// before_head and after_head are used to save the heads of the two lists.
// All of these are initialized with the dummy nodes created.
ListNode before_head = new ListNode(0);
ListNode before = before_head;
ListNode after_head = new ListNode(0);
ListNode after = after_head;
while (head != null) {
// If the original list node is lesser than the given x,
// assign it to the before list.
if (head.val < x) {
before.next = head;
before = before.next;
} else {
// If the original list node is greater or equal to the given x,
// assign it to the after list.
after.next = head;
after = after.next;
}
// move ahead in the original list
head = head.next;
}
// Last node of "after" list would also be ending node of the reformed list
after.next = null;
// Once all the nodes are correctly assigned to the two lists,
// combine them to form a single list which would be returned.
before.next = after_head.next;
return before_head.next;
}
}