给定一个链表和值x，对其进行分区，使得小于x的所有节点都位于大于或等于x的节点之前，同时保留两个分区中每个分区中节点的原始相对顺序。

public class PartitionList
{
public PartitionList(){}

public ListNode partition(ListNode head, int x) 
{
	if(head == null)
	{return head;}
	
	ListNode before_head= new ListNode(0);
	ListNode before= before_head;
	ListNode after_head= new ListNode(0);
	ListNode after= after_head;
	
	while(head!=null)
	{
		if(head.val < x)
		{
			before.next= head;
			before= before.next;
		}
		else
		{
			after.next= head;
			after= after.next;
		}
		head= head.next;
	}
	after.next= null;
	before.next= after_head.next;
	return before_head.next;
}

}